CPU Scheduling for Active Processing using Feedback Deficit Round Robin

Title: CPU Scheduling for Active Processing using Feedback Deficit Round Robin

Authors: Tilman Wolf and Dan Decasper

Abstract: In active networks, much processing power is required for the execution of packet processing code that is carried in or referenced by active packets. In high-bandwidth environments the processor performing this active processing poses a bottleneck. We present a processor scheduling algorithm called Feedback Deficit Round Robin (FDRR) that reduces the overhead for fair scheduling and context switching by estimating the processing time for each active packet. Simulation results show that FDRR performs significantly better when compared to Round Robin scheduling.

Published: Tilman Wolf and Dan Decasper, "CPU scheduling for active processing using feedback deficit round robin," in Proc. of the 37th Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sept. 1999, pp. 768-769.

Download: PDF

BibTeX:
@inproceedings{Wolf:CPU99,
   author    = {Tilman Wolf and Dan Decasper},
   title     = {{CPU} Scheduling for Active Processing using Feedback Deficit Round Robin},
   booktitle = {Proc. of the 37th Allerton Conference on Communication, Control, and Computing},
   year      = 1999,
   month     = sep,
   address   = {Monticello, IL},
   pages     = {768--769}
}
Copyright: © 1999 Tilman Wolf and Dan Decasper.