Approximating the throughput of multiple machines in real-time scheduling

SIAM Journal on Computing

Volumn 31, Issue 2, 2001, Pages 331-352

  Bar Noy, Amotz ^a   Guha, Sudipto ^a   Naor, Joseph ^b   Schieber, Baruch ^c  

^a AT AND T LABS RESEARCH   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; Multiple machines scheduling; Parallel machines scheduling; Real time scheduling; Scheduling; Throughput

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; PROBLEM SOLVING; SCHEDULING; THROUGHPUT;

REAL-TIME SCHEDULING;

REAL TIME SYSTEMS;

EID: 0036253499     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799354138     Document Type: Article

References (33)

1. M. ADLER, A. L. ROSENBERG, R. K. SITARAMAN, AND W. UNGER, Scheduling time-constrained communication in linear networks, in Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York, 1998, pp. 269-278.
2. S. ALBERS, N. GARG, AND S. LEONARDI, Minimizing stall time in single and parallel disk systems, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1998, pp. 454-462.
3. E. M. ARKIN AND E. B. SILVERBERG, Scheduling jobs with fixed start and end times, Discrete Appl. Math., 18 (1987), pp. 1-8.
4. B. AWERBUCH, Y. AZAR, A. FIAT, S. LEONARDI, AND A. ROSÉN, On-line competitive algorithms for call admission in optical networks, in Proceedings of the 4th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 1136, Springer-Verlag, New York, 1996, pp. 431-444.
5. B. AWERBUCH, Y. BARTAL, A. FIAT, AND A. ROSÉN, Competitive non-preemptive call control, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1994, pp. 312-320.
6. A. BAR-NOY, R. BAR-YEHUDA, A. FREUND, J. NAOR, AND B. SCHIEBER, A unified approach to approximating resource allocation and scheduling, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM Press, New York, 2000, pp. 735-744.
7. A. BAR-NOY, R. CANETTI, S. KUTTEN, Y. MANSOUR, AND B. SCHIEBER, Bandwidth allocation with preemption, SIAM J. Comput., 28 (1999), pp. 1806-1828.
8. S. BARUAH, G. KOREN, D. MAO, B. MISHRA, A. RAGHUNATHAN, L. ROSIER, D. SHASHA, AND F. WANG, On the competitiveness of on-line real-time task scheduling, Real-Time Systems, 4 (1992), pp. 125-144.
9. P. BERMAN AND B. DASGUPTA, Improvements in throughput maximization for real-time scheduling, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM Press, New York, 2000, pp. 680-687.
10. S. BOYD AND R. CARR, A new bound for the ratio between the 2-matching problem and its linear programming relaxation, Math. Program., Ser. A, 86 (1999), pp. 499-514.
11. J. BLAZEWICZ, K. H. ECKER, G. SCHMIDT, AND J. WEGLARZ, Scheduling in Computer and Manufacturing Systems, Springer-Verlag, New York, 1994.
12. G. CORNUEJOLS, M. FISHER, AND G. NEMHAUSER, Location of bank accounts to optimize float, Management Science, 23 (1977), pp. 789-810.
13. T. ERLEBACH AND K. JANSEN, Conversion of coloring algorithms into maximum weight independent set algorithms, in Proceedings of the Workshop "Approximation and Randomization Algorithms in Communication Networks" (ARACNE 2000), Proceedings on Informatics 8, Carleton Scientific, Waterloo, ON, Canada, 2000, pp. 135-145.
14. U. FAIGLE AND W. M. NAWIJN, Note on scheduling intervals on-line, Discrete Appl. Math., 58 (1995), pp. 13-17.
15. M. FISCHETTI, S. MARTELLO, AND P. TOTH, The fixed job schedule problem with spread-time constraints, Oper. Res., 35 (1987), pp. 849-858.
16. J. A. GARAY, I. S. GOPAL, S. KUTTEN, Y. MANSOUR, AND M. YUNG, Efficient on-line call control algorithms, J. Algorithms, 23 (1997), pp. 180-194.
17. M. R. GAREY AND D. S. JOHNSON, Two-processor scheduling with start-times and deadlines, SIAM J. Comput., 6 (1977), pp. 416-426.
18. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
19. S. A. GOLDMAN, J. PARWATIKAR, AND S. SURI, On-line scheduling with hard deadlines, in Proceedings of the 5th International Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 1272, Springer-Verlag, New York, 1997, pp. 258-271.
20. M. H. GOLDWASSER, Patience is a virtue: The effect of slack on competitiveness for admission control, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1999, pp. 396-405.
21. N. G. HALL AND M. J. MAGAZINE, Maximizing the value of a space mission, European J. Oper. Res., 78 (1994), pp. 224-241.
22. B. KALYANASUNDARAM AND K. PRUHS, Eliminating migration in multi-processor scheduling, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1999, pp. 499-506.
23. H. KISE, T. IBARAKI, AND H. MINE, A solvable case of one machine scheduling problem with ready and due dates, Oper. Res., 26 (1978), pp. 121-126.
24. G. KOREN AND D. SHASHA, An optimal on-line scheduling algorithm for overloaded real-time systems, SIAM J. Comput., 24 (1995), pp. 318-339.
25. E. L. LAWLER, Sequencing to minimize the weighted number of tardy jobs, Recherche Operationnel, 10 (1976), pp. 27-33.
26. E. L. LAWLER, A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs, Ann. Oper. Res., 26 (1990), pp. 125-133.
27. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS, Sequencing and Scheduling: Algorithms and Complexity, in Handbooks in Operations Research and Management Science, Vol. 4: Logistics for Production and Inventory, S. C. Graves, A. H. G. Rinnooy Kan, and P. H. Zipkin, eds., North Holland, Amsterdam, 1993, pp. 445-522.
28. R. J. LIPTON AND A. TOMKINS, Online interval scheduling, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1994, pp. 302-311.
29. C. PHILLIPS, R. N. UMA, AND J. WEIN, Off-line admission control for general scheduling problems, in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, 2000, pp. 879-888.
30. S. SAHNI, Algorithms for scheduling independent tasks, J. ACM, 23 (1976), pp. 116-127.
31. F. C. R. SPIEKSMA, On the approximability of an interval scheduling problem, J. Sched., 2 (1999), pp. 215-227.
32. G. WOEGINGER, When does a dynamic programming formulation guarantee the existence of an FPTAS?, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1999, pp. 820-829.
33. M. YANNAKAKIS, On the approximation of maximum satisfiability, in Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1992, pp. 1-9.