Minimizing flow time nonclairvoyantly

Journal of the ACM

Volumn 50, Issue 4, 2003, Pages 551-567

  Kalyanasundaram, Bala ^a   Pruhs, Kirk R ^b,c  

^a GEORGETOWN UNIVERSITY   (United States)

^b UNIVERSITY OF PITTSBURGH   (United States)

^c University of Pittsburgh   (United States)

Author keywords

Flow time; Multilevel feedback; Randomized algorithm; Resource augmentation; Scheduling; Shortest elapsed time first

Indexed keywords

FLOW TIME; MULTILEVEL FEEDBACK; RANDOMIZED ALGORITHMS; RESOURCE AUGMENTATION; SHORTEST ELAPSED TIME FIRST;

ALGORITHMS; COMPUTER OPERATING SYSTEMS; FEEDBACK; PROBLEM SOLVING;

SCHEDULING;

EID: 33646729635     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/792538.792545     Document Type: Article

References (17)

1. BACH, M. 1986. The Design of the UNIX Operating System. Prentice-Hall, Englewood Cliffs, N. J.
2. BERMAN, P., AND COULSTON, C. 1999. Speed is more powerful than clairvoyance. Nord. J. Comput. 6, 2, 181-193.
3. BORODIN, A., AND EL-YANIV, R. 1998. On-Line Computation and Competitive Analysis. Cambridge University Press, Cambridge, Mass.
4. BRUCKER, P. 1995. Scheduling Algorithms. Springer-Verlag, New York.
5. COFFMAN, E., AND DENNING, P. 1973. Operating Systems Theory. Prentice-Hall, Englewood Cliffs, N. J.
6. CORMEN, T., LEISERSON, C., AND RIVEST, R. 1990. Introduction to Algorithms. McGraw-Hill, New York.
7. EDMONDS, J. 2000. Scheduling in the dark. Theoret. Comput. Sci. 235, 1, 109-141.
8. EVAN, M., HASTINGS, N., AND PEACOCK, B. 1993. Statistical Distributions. Wiley, New York.
9. KALYANASUNDARAM, B., AND PRUHS, K. 2000. Speed is as powerful as clairvoyance. J. ACM 47, 4, 617-643.
10. LAWLER, E., LENSTRA, J., KAN, A., AND SHMOYS, D. 1993. Sequencing and scheduling: algorithms and complexity. In Logistics of Production and Inventory. Handbooks in Operations Research and Management Science. Vol. 4. North-Holland. 445-522.
11. LEONARDI, S., AND RAZ, D. 1997. Approximating total flow time on parallel machines. In proceedings of the ACM Symposium on Theory of Computing (STOC). ACM, New York, pp. 110-119.
12. MADNICK, S., AND DONOVAN, J. 1974. Operating Systems. McGraw-Hill, New York.
13. MATSUMOTO, T. 1992. Competitive analysis of the round robin algorithm. In proceedings of the International Symposium on Algorithms and Computation. 11-77.
14. MOTWANI, R., PHILLIPS, S., AND TORNG, E. 1994. Nonclairvoyant scheduling. Theoret. Comput. Sci. 130, 1, 17-47.
15. PHILLIPS, C. A., STEIN, C., TORNG, E., AND WEIN, J. 2002. Optimal time-critical scheduling via resource augmentation. Algorithmica 32, 2, 163-200.
16. SGALL, J. 1998. On-line scheduling. In Online Algorithms: The State of the Art. A. Fiat and G. J. Woeginger, Eds. Springer-Verlag. 196-231.
17. SILVERSCHATZ, A., AND GAL VIN, P. 1994. Operating System Concepts. Addison-Wesley, Reading, Mass.