Optimal time-critical scheduling via resource augmentation

Algorithmica (New York)

Volumn 32, Issue 2, 2002, Pages 163-200

  Phillips, C A ^a   Stein, C ^b   Torng, E ^c   Wein, J ^d  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b Columbia University ^*  (United States)

^c Michigan State University   (United States)

^d POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Competitive analysis; Extra resources; On line algorithms; Real time; Row time; Scheduling

Indexed keywords

ALGORITHMS; MULTIPROCESSING SYSTEMS; ONLINE SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

RESOURCE AUGMENTATION;

SCHEDULING;

EID: 0042209421     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0068-9     Document Type: Article

References (29)

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko. Approximation schemes for minimizing average weighted completion time with release dates. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 32-43, 1999.
2. S. K. Baruah and J. R. Harista. Scheduling for overload in real-time systems. IEEE Transactions on Computers, 46:1034-1039, 1997.
3. M. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pages 270-279, 1998.
4. S. Chakrabarti, C. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein, and J. Wein. Improved scheduling algorithms for minsum criteria. In Proceedings of the 1996 International Colloquium on Automata, Languages and Programming, pages 646-657, 1996. Lecture Notes in Computer Science 1099. Springer-Verlag, Berlin, 1996.
5. C. Coulston and P. Herman. Speed is more powerfull than clairvoyance. Nordic Journal of Computing, 6:181-193, 1999.
6. M. Dertouzos. Control robotics: the procedural control of physical processes. In Proceedings of the IFIF Congress,pages 807-813, 1974.
7. M. Dertouzos and A. Mok. Multiprocessor on-line scheduling of hard-real-time tasks. IEEE Transactions on Software Engineering, 15:1497-1506, 1989.
8. J. Edmonds. Scheduling in the dark. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 179-188, 1999.
9. M. Goemans. A supermodular relaxation for scheduling with release dates. In Proceedings of the 5th MPS Conference on Integer Programming and Combinatorial Optimization, pages 288-300, 1996.
10. M. Goemans. Improved approximation algorithms for scheduling with release dates. In Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, pages 591-598, 1997.
11. M. Goemans, M. Queyranne, A. Schulz, M. Skutella, and Y. Wang. Single machine scheduling with release dates. Submitted for publication, 1999.
12. M. Goldwasser. Patience is a virtue: the effect of slack on competitiveness for admission control. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pages 396-405, 1999.
13. R. L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563-1581, 1966.
14. D. Gusfield. Bounds for naive multiple machine scheduling with release times and deadlines. Journal of Algorithms, 5:1-6, 1984.
15. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Mathematics of Operations Research, 22:513-544, 1997.
16. J. A. Hoogeveen and A. P. A. Vestjens. Optimal on-line algorithms for single-machine scheduling. In Proceedings of the 5th MPS Conference on Integer Programming and Combinatorial Optimization, pages 404-414, 1996. Lecture Notes in Computer Science 1084. Springer-Verlag, Berlin, 1996.
17. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 115-124, 1995. Also in Journal of the ACM, 47:617-643, 2000.
18. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 115-124, 1995. Also in Journal of the ACM, 47:617-643, 2000.
19. B. Kalyanasundaram and K. Pruhs. Maximizing job completions online. In Proceedings of the European Symposium on Algorithms,pages 235-246, 1998.
20. B. Kalyanasundaram and K. Pruhs. Eliminating migration in multi-processor scheduling. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pages 499-506, 1999.
21. H. Kellerer, T. Tautenhahn, and G. J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. SIAM Journal on Computing, 28(4):1155-1166, 1999.
22. G. Koren and D. Shasha. MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling. Theoretical Computer Science, 128:75-97, 1994.
23. J. Labetoulle, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinooy Kan. Preemptive scheduling of uniform machines subject to release dates. In W. R. Pulleyblank, editor, Progress in Combinatorial Optimization,pages 245-261. Academic Press, New York, 1984.
24. T. Lam and K. To. Trade-offs between speed and processor in hard-deadline scheduling. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pages 623-632, 1999.
25. S. Leonardi and D. Raz. Approximating total flow time on parallel machines. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 110-119, 1997.
26. R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant scheduling. Theoretical Computer Science, 130(1):17-47, 1994.
27. C. Phillips, C. Stein, and J. Wein. Scheduling jobs that arrive over time. Math Programming B, 82:199-223, 1998.
28. S. Sahni and Y. Cho. Nearly on line scheduling of a uniform processor system with release times. SIAM Journal on Computing, 8:275-285, 1979.
29. D. B. Shmoys, J. Wein, and D. P. Williamson. Scheduling parallel machines on-line. SIAM Journal on Computing, 24:1313-1331, 1995.