AS201281 Wiki

Your check engine light is on!

User Tools

Site Tools

Trace: • re56_scheduler_proportional_fair
studies:re56:re56_scheduler_proportional_fair

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Next revision		Previous revision
studies:re56:re56_scheduler_proportional_fair [2013/05/11 17:05] – créée jmultonstudies:re56:re56_scheduler_proportional_fair [2021/01/04 20:41] (current) – external edit 127.0.0.1
Line 1: Line 1:
-Proportional fair+__Proportional fair__
  
 This scheduler algorithm is a mix between the 2 previous algorithms : round-robin & max-CQI. It combines the equity principle of round-robin and the throughput optimization principle of max-CQI. This scheduler algorithm is a mix between the 2 previous algorithms : round-robin & max-CQI. It combines the equity principle of round-robin and the throughput optimization principle of max-CQI.
Line 9: Line 9:
  
 ProportionalFair (List<User> users, List<RBG> rbgs) { ProportionalFair (List<User> users, List<RBG> rbgs) {
- 
  List<User> data2send;  List<User> data2send;
  foreach User u in users {  foreach User u in users {
  if (u->queue.notEmpty()) {  if (u->queue.notEmpty()) {
- 
  u->instantThroughput = u.updateThroughput();  u->instantThroughput = u.updateThroughput();
  u->PFmetric = u->instantThroughput / u->averageThroughput;  u->PFmetric = u->instantThroughput / u->averageThroughput;
- 
  if (data2send.isEmpty()) {  if (data2send.isEmpty()) {
  data2send.add(u);  data2send.add(u);
Line 28: Line 25:
  }  }
  }  }
- 
  boolean full = false;  boolean full = false;
  foreach User u in data2send {  foreach User u in data2send {
Line 46: Line 42:
  
 } }
 +
  
studies/re56/re56_scheduler_proportional_fair.1368291906.txt.gz · Last modified: 2021/01/04 20:41 (external edit)