Fair on-line scheduling of a dynamic set of tasks on a single resource

Information Processing Letters

Volumn 64, Issue 1, 1997, Pages 43-51

  Baruah, Sanjoy K ^a   Gehrk, Johannes E ^b   Plaxton, C Greg ^c   Stoica, Ion ^d   Abdel Wahab, Hussein ^d   Jeffay, Kevin ^e  

^a University of Vermont   (United States)

^b University of Wisconsin Madison   (United States)

^c University of Texas at Austin   (United States)

^d ECS Building   (United States)

^e UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Algorithms; Fairness; On line scheduling; Periodic tasks

Indexed keywords

EID: 0012075674     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00149-x     Document Type: Article

References (18)

1. S.K. Baruah, N.K. Cohen, C.G. Plaxton, D.A. Varvel, Proportionate progress; A notion of fairness in resource allocation, Algorithmica 15 (1996) 600-625
2. S.K. Baruah, J.E. Gehrke, C.G. Plaxton, Fast scheduling of periodic tasks on multiple resources. Tech. Rept. TR-95-02, Dept. of Computer Science, University of Texas, Austin, TX, 1995.
3. S.K. Baruah, J.E. Gehrke, C.G. Plaxton, Fast scheduling of periodic tasks on multiple resources, in: Proc. 9th Internat. Parallel Processing Symp., 1995, pp. 280-288.
4. 2Q: Worst-case fair queueing, in: Proc. IEEE INFOCOM'96, 1996, pp. 120-128.
5. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
6. R.L. Cruz, A calculus for network delay, Part I: Network elements in isolation, IEEE Trans. Inform. Theory 37 (1991) 114-131.
7. A. Demers, S. Keshav, S. Shenker, Analysis and simulation of a fair queueing algorithm, J. Internetworking Res. and Experience (1990) 3-26.
8. U. Maheshwari, Charge-based proportional scheduling, Tech. Memorandum, MIT/LCS/TM-529, Laboratory for Computer Science, MIT, Cambridge, MA, 1995.
9. E.M. McCreight, Priority search trees, SIAM J. Comput. 14 (1985) 257-276.
10. A.K. Parekh, R.G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single node case, IEEE/ACM Trans. Networking 1 (1993) 344-357.
11. A.K. Parekh, R.G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The multiple node case, IEEE/ACM Trans. Networking 2 (1994) 137-150.
12. I. Stoica and H. Abdel-Wahab, Earliest eligible virtual deadline first: A flexible and accurate mechanism for proportional share resource allocation, Tech. Rept. TR-95-22, Dept. of Computer Science, Old Dominion University, Norfolk, VA, 1995.
13. I. Stoica and H. Abdel-Wahab, A new approach to implement proportional share resource allocation, Tech. Rept. TR-95-05, Dept. of Computer Science, Old Dominion University, Norfolk, VA, 1995.
14. I. Stoica, H. Abdel-Wahab, K. Jeffay, S.K. Baruah, J.E. Gehrke, C.G. Plaxto, A proportional share resource allocation algorithm for real-time, time-shared systems, in: Proc. 17th Ann. IEEE Real-Time Systems Symp., 1996, to appear.
15. R. Tijdeman, The chairman assignment problem, Discrete Math. 32 (1980) 323-330.
16. C.A. Waldspurger, Lottery and stride scheduling: Flexible proportional-share resource management, Ph.D. Thesis, Laboratory for Computer Science, MIT, Cambridge, MA, 1995.
17. C.A. Waldspurger, W.E. Weihl, Lottery scheduling: Flexible proportional-share resource management, in: Proc. 1st Symp. on Operating System Design and Implementation, 1994, pp. 1-12.
18. C.A. Waldspurger, W.E. Weihl, Stride scheduling: Deterministic proportional-share resource management, Tech. Memorandum, MIT/LCS/TM-528, Laboratory for Computer Science, MIT, Cambridge, MA, 1995.