Speed is as powerful as clairvoyance

Journal of the ACM

Volumn 47, Issue 4, 2000, Pages 617-643

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

^a UNIVERSITY OF PITTSBURGH   (United States)

^b Learning Research and Development Ctr   (United States)

Author keywords

Multi level feedback scheduling; Resource augmentation; Scheduling

Indexed keywords

CLAIRVOYANCE; MULTI-LEVEL FEEDBACK SCHEDULING; RESOURCE AUGMENTATION;

ALGORITHMS; APPROXIMATION THEORY; DECISION MAKING; FEEDBACK; ONLINE SYSTEMS; PROBLEM SOLVING; REAL TIME SYSTEMS;

SCHEDULING;

EID: 0000696568     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/347476.347479     Document Type: Article

References (33)

1. ALBERS, S., ARORA, S., AND KHANNA, S. 1999. Page replacement for generalized caching problems. In Proceedings of the 10th Annual ACM-SLAM Symposium on Discrete Algorithms (Baltimore, Md., Jan. 17-19). ACM, New York, pp. 31-40.
2. BARUAII, S., AND HARITSA, J. 1997. Scheduling for overload in real-time systems. IEEE Trans. Comput. 46, 1034-1039.
3. BARUAH, S., HARITSA, J., AND SHARMA, N. 1994. On-line scheduling to maximize task completions. In Proceedings of the IEEE Real-Time Systems Symposium. IEEE Computer Society Press, Los Alamitos, Calif., pp. 228-237.
4. BARUAH, S., KOREN, G., MAO, D., MISHRA, B., RAGHUNATHAN, A., ROSIER, L., SHASHA, D., AND WANG, F. 1992. On the competitiveness of on-line real-time task scheduling. J. Real-Time Syst. 4, 124-144.
5. BARUAH, S., KOREN, G., MISHRA, B., RAGHUNATHAN, A., ROSIER, L., AND SHASHA, D. 1991. On-line scheduling in the presence of overload. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 101-110.
6. BEN-DAVID, S., AND BORODIN, A. 1994. A new measure for the study of on-line algorithms. Algorithmica 11, 73-91.
7. BERMAN, P., AND COULSTON, C. 1998. Speed is more powerful than clairvoyance. In Proceedings of the Scandinavian Workshop on Algorithms and Theory, pp. 255-263.
8. BORODIN, A., AND EL-YANIV, R. 1998. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge.
9. BRUCKER, P. 1995. Scheduling Algorithms. Springer-Verlag, New York.
10. COLWELL, R., SUCHOZA, R., AND ZoRlNE, D. 1995. On-line real-time scheduling with laxities. Manuscript.
11. EDMONDS, J. 1999. Scheduling in the dark. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (Atlanta, Ga., May 1-4). ACM, New York, pp. 179-188.
12. GALVIN, P., AND SILVERSCHATZ, A. 1994. Operating System Concepts. Addison-Wesley, Reading, Mass.
13. HALL, L. 1997. Approximation algorithms for scheduling. In Approximation Algorithms for NP-hard Problems. D. Hochbaum, ed. Chap. 2. PWS Publishing.
14. KALYANASUNDARAM, B., AND PRUHS, K. 1997. Fault-tolerant real-time scheduling. In Proceedings of the European Symposium on Algorithms. Springer-Verlag, New York, pp. 296-307.
15. KALYANASUNDARAM, B., AND PRUHS, K. 1995. The online transportation problem. In Proceedings of the European Symposium on Algorithms. Springer-Verlag, New York, pp. 484-493.
16. KALYANASUNDARAM, B., AND PRUHS, K. 1997. Minimizing flow-time nonclairvoyantly. In Proceed-ings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif. Springer-Verlag, New York, pp. 345-352.
17. KALYANASUNDARAM, B., AND PRUHS, K. 1998. Maximizing job completions online. In Proceedings of the European Symposium on Algorithms. Springer-Verlag, New York, pp. 235-246.
18. KOUTSOUPIAS, E., AND PAPADiMiTRiou, C. 1994. Beyond competitive analysis. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif. Springer-Verlag, New York, pp. 394-400.
19. KNUTH, D. 1973. The Art of Computer Programming, vol. 1. Addison-Wesley, Reading, Mass.
20. KOREN, G., AND SHASHA, D. 1992. D°ver: An optimal on-line scheduling algorithm for overloaded real-time systems. In Proceedings of the IEEE Real-time Systems Symposium. IEEE Computer Society Press, Los Alamitos, Calif., pp. 290-299.
21. KOREN, G., AND SHASHA, D. 1994. MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling. Theoret. Comput. Sei. 128, 75-97.
22. LAM, T. W., AND To, K. K. 1999. Trade-offs between speed and processor in hard-deadline scheduling. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, Md., Jan. 17-19). ACM, New York, pp. 623-632.
23. LAWLER, E., LENSTRA, J. K., RINNOOY KAN, A., AND SHMOYS, D. 1993. Sequencing and scheduling: algorithms and complexity. In Logistics of Production and Inventory, Handbooks in OR & MS 4, S. Graves, A. Rinnooy Kan, and P. Zipkin, eds. Chap. 9. Elsevier Science, Amsterdam, The Netherlands, pp. 445-522.
24. MANSOUR, Y., AND PATT-SHAMIR, B. 1998. Jitter control in QoS networks. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 50-59.
25. MATSUMOTO, T. 1992. Competitive analysis of the round robin algorithm. In Proceedings of the International Symposium on Algorithms and Computation. 71-77.
26. MlLENKOVIC, M. 1992. Operating Systems: Concepts and Designs. McGraw-Hill, New York.
27. MOTWANI, R., PHILLIPS, S., AND TORNG, E. 1994. Non-clairvoyant scheduling. Theoret. Comput. Sei. 130, 17-47.
28. PHILLIPS, C., STEIN, C., TORNG, E., AND WEIN, J. 1997. Optimal time-critical scheduling via resource augmentation. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, Tex., May 4-6). ACM, New York, pp. 140-149.
29. RAGHAVAN, P. 1992. A statistical adversary for on-line algorithms. Online Algorithms, DIMACS Series in Discrete Mathematics and Computer Science 7, 79-83.
30. SGALL, J. 1998. On-line scheduling-A survey. In On-Line Algorithms: The State of the Art, A. Fiat and G. Woeginger, eds. Lecture Notes in Computer Science, Springer-Verlag, New York.
31. SLEATOR, D., AND TARJAN, R. E. 1985. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2 (Feb.), 202-208.
32. WOEGINGER, G. 1994. On-line scheduling of jobs with fixed start and end time. Theoret. Comput. Sei. 130, 5-16.
33. YOUNG, N. 1994.The fc-server dual and loose competitiveness for paging. Algorithmica 11, 525-541.