mxinden

Homepage of Max Inden

25th DistSys Reading Group - Fair queuing

Posted at — Apr 27, 2020

In the session today we covered Madhavapeddi Shreedhar and George Varghese paper “Efficient fair queuing using deficit round-robin” [1]. While the session was not so much about the relatively simple algorithmic details of deficit-round-robin (still worth checking out) we talked about:

For those interested here are sources mentioned during the session:

Next up we will talk about cache coherence protocols.


References

[1] Shreedhar, Madhavapeddi, and George Varghese. “Efficient fair queuing using deficit round-robin.” IEEE/ACM Transactions on networking 4.3 (1996): 375-385.

https://www2.cs.duke.edu/courses/spring09/cps214/papers/drr.pdf