Fairness in Scheduling

Journal of Algorithms

Volumn 29, Issue 2, 1998, Pages 306-357

  Ajtai, Miklos ^a   Aspnes, James ^b   Naor, Moni ^g   Rabani, Yuval ^c,d,f   Schulman, Leonard J ^e   Waarts, Orli ^e  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b Yale University   (United States)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e UNIVERSITY OF CALIFORNIA   (United States)

^f UNIVERSITY OF TORONTO   (Canada)

^g NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039014249     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0953     Document Type: Article

References (23)

1. R. Anderson, L. Lovász, P. Shor, J. Spencer, E. Tardos, and S. Winograd, Disks, balls, and walls: Analysis of a combinatorial game, Amer. Math. Monthly 96 (1989), 481-493.
2. T. E. Anderson, S. Owicki, J. B. Saxe, and C. P. Thacker, High speed, switch scheduling for local area networks, ACM Trans. Comm. Syst. 11(4) (1993), 319-352.
3. J. Aspnes, Y. Azar, A. Fiat, S. A. Plotkin, and O. Waarts, On-line load balancing with applications to machine scheduling and virtual circuit routing, in "Proc. of the 25th Ann. ACM Sympos. on Theory of Computing," pp. 623-631, May 1993.
4. Y. Azar, A. Broder, A. Karlin, and E. Upfal, Balanced allocations, in "Proc. of the 26th Ann. ACM Sympos. on Theory of Computing," pp. 593-602, May 1994.
5. Y. Azar, J. Naor, and R. Rom, The competitiveness of on-line assignment, in "Proc. of the 3rd Ann. ACM-SIAM Sympos. on Discrete Algorithms," pp. 203-210, 1992.
6. Zs. Baranyai, On the factorization of the complete uniform hypergraph, in "Infinite and Finite Sets," Colloquia Mathematica Societatis János Bolyai, 1973.
7. Y. Bartal, A. Fiat, H. Karloff, and R. Vohra, New algorithms for an ancient scheduling problem, in "Proc. of the 24th Ann. ACM Sympos. on Theory of Computing," pp. 51-58, 1992.
8. J. Beck, Balanced two-colorings of finite sets in the cube, Discrete Math. 73 (1988-9), 13-25.
9. J. Beck and T. Fiala, Integer-making theorems, Discrete Appl. Math. 3 (1981), 1-8.
10. S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson, On the power of randomization in online algorithms, in "Proc. of the 22nd Ann. ACM Sympos. on Theory of Computing," pp. 379-386, May 1990.
11. A. Borodin, N. Linial, and M. Saks, An optimal on-line algorithm for metrical task systems, in "Proc. of the 19th Ann. ACM Sympos. on Theory of Computing," pp. 373-382, May 1987.
12. A. Charny, "An Algorithm for Rate Allocation in a Packet-Switching Network with Feedback," MIT/LCS TR-601, 1994.
13. D. Coppersmith, private communication.
14. E. Davis and J. M. Jaffe, Algorithms for scheduling tasks on unrelated processors, J. Assoc. Comput. Mach. 28 (1981), 712-736.
15. A. Demers, S. Keshav, and S. Shenkar, Analysis and simulation of a fair queuing algorithm, in "Proc. ACM SIGCOMM 89," pp. 1-12.
16. R. Fagin and J. H. Williams, A fair carpool scheduling algorithm, IBM Journal of Research and Development, 27(2) (1983), 133-139.
17. R. L. Graham, Bounds for certain multiprocessing anomalies, Bell System Technical Journal 45 (1966), 1563-1581.
18. E. Hahne, Round-robin scheduling for maxmin fairness in data networks, IEEE J. Selected Areas in Communication 9(7) (1991).
19. K. Ramakrishnan and R. Jain, A binary feedback scheme for congestion avoidance in computer networks, ACM Trans. Comm. Syst. 8(2) (1990), 158-181.
20. D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM 28(2) (1985), 202-208.
21. D. Shmoys, J. Wein, and D. P. Wiliamson, Scheduling parallel machines on-line, in "Proc. of the 32nd IEEE Ann. Sympos. on Foundations of Computer Science," pp. 131-140, 1991.
22. R. Tijdeman, The chairman assignment problem, Discrete Math. 32 (1980), 323-330.
23. A. C. Yao, Probabilistic computation, towards a unified measure of complexity, in "Proc. of the 18th Ann. IEEE Sympos. on Foundation of Computer Science," pp. 222-227, 1977.