Nonclairvoyant scheduling
Authors:
- Rajeev MotwaniRMRajeev Motwani
- Steven PhillipsSPSteven Phillips
- Eric TorngETEric Torng
- 1 August 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 130 (1) , 17-47
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Dynamic scheduling on parallel machines1991
- An on-line graph coloring algorithm with sublinear performance ratioDiscrete Mathematics, 1989
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- The drinking philosophers problemACM Transactions on Programming Languages and Systems, 1984
- Upper bounds for static resource allocation in a distributed systemJournal of Computer and System Sciences, 1981
- Hierarchical ordering of sequential processesActa Informatica, 1971
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952