Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 94-103

  Becchetti, L ^a   Leonardi, S ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER OPERATING SYSTEMS;

PARALLEL MACHINE SYSTEMS;

SCHEDULING;

EID: 0034819598     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380782     Document Type: Conference Paper

References (15)

1. Minimizing the flow time without migration
2. On the power of randomization in on-line algorithms
3. Speed is as powerful as clairvoyance
4. Minimizing flow time nonclairvoyantly
5. Approximating total flow time on parallel machines
6. Non-clairvoyant scheduling
7. A library implementation of POSIX threads under UNIX
8. Amortized efficiency of list update and paging rules