1. Helmy T, Dekdouk A (2007) Burst round robin as a proportional-share scheduling algorithm. IEEEGCC, 2007
2. Shreedhar M, Varghese G (1996) Efficient fair queuing using deficit round-robin. IEEE/ACM Trans Netw., Jun 1996
3. Silberschatz A, Galvin PB, Gagne G (1998) Operating system concepts, vol 4. Addison-Wesley, Reading
4. Uuganbaatar N (2010) Optimality of first-come-first-served: a unified approach. (2010, December)
5. Chung J, Chatterjee D (2013, August) Enhanced shortest-job-first memory request scheduling