Fairness in Scheduling
Authors:
- Miklos AjtaiMAMiklos Ajtai
- James AspnesJAJames Aspnes
- Moni NaorMNMoni Naor
- Yuval RabaniYRYuval Rabani
- Leonard J SchulmanLSLeonard J Schulman
- Orli WaartsOWOrli Waarts
Open Access
- 1 November 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 29 (2) , 306-357
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- New Algorithms for an Ancient Scheduling ProblemJournal of Computer and System Sciences, 1995
- High-speed switch scheduling for local-area networksACM Transactions on Computer Systems, 1993
- Round-robin scheduling for max-min fairness in data networksIEEE Journal on Selected Areas in Communications, 1991
- A binary feedback scheme for congestion avoidance in computer networksACM Transactions on Computer Systems, 1990
- Analysis and simulation of a fair queueing algorithmACM SIGCOMM Computer Communication Review, 1989
- Disks, Balls, and Walls: Analysis of a Combinatorial GameThe American Mathematical Monthly, 1989
- Balanced two-colorings of finite sets in the cubeDiscrete Mathematics, 1988
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Algorithms for Scheduling Tasks on Unrelated ProcessorsJournal of the ACM, 1981
- The chairman assignment problemDiscrete Mathematics, 1980