Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling

Journal of Combinatorial Optimization

Volumn 4, Issue 3, 2000, Pages 307-323

  Berman, Piotr ^a   Dasgupta, Bhaskar ^b  

^a The Pennsylvania State University   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Real time scheduling; Throughput maximization

Indexed keywords

EID: 0000332042     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009822211065     Document Type: Article

References (18)

1. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J.(S.) Naor, and B. Schieber, "A unified approach to approximating resource allocation and scheduling," to appear in Proc. 32nd ACM STOC, May 2000.
2. A. Bar-Noy, S. Guha, J.(S.) Naor, and B. Schieber, "Approximating the throughput of multiple machines in real-time scheduling," in Proc. 31st ACM STOC, 1999, pp. 622-631. Full version available at Prof. Amotz Bar-Noy's web-site http://www.eng.tau.ac.il/∼amotz/.
3. 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 scheduling," Real-Time Systems, vol. 4, pp. 125-144, 1992.
4. L. Becchetti, S. Leonardi, and S. Muthukrishnan, "Scheduling to minimize average stretch without migration," in Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms, 2000, pp. 548-557.
5. M. Bender, S. Chakrabarti, and S. Muthukrishnan, "Flow and stretch metrics for scheduling continuous job streams," in Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms, 1999.
6. P. Berman, Z. Zhang, J. Bouck, and W. Miller, "Large aligning two fragmented sequences," manuscript, submitted for journal publication.
7. H. Kise, T. Ibaraki, and H. Mine, "A solvable case of one machine scheduling problems with ready and due dates," Operations Research, vol. 26, pp. 121-126, 1978.
8. G. Koren and D. Shasha, "An optimal on-line scheduling algorithm for overloaded real-time systems," SIAM J. on Computing, vol. 24, pp. 318-339, 1995.
9. E.L. Lawler, "A dynamic programming approach for preemptive scheduling of a single machine to minimize the number of late jobs," Annals of Operations Research, vol. 26, pp. 125-133, 1990.
10. R.J. Lipton and A. Tomkins, "Online interval scheduling," in Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 302-311.
11. H. Liu and M.E. Zarki, "Adaptive source rate control for real-time wireless video transmission," Mobile Networks and Applications, vol. 3, pp. 49-60, 1998.
12. S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J.E. Gehrke, "Online scheduling to minimize average stretch," in Proc. 40th Annual IEEE Symp. on Foundations of Computer Science, 1999, pp. 433-443.
13. M.H. Overmars, "Computational geometry on a grid: An overview," in Theoretical Foundations of Computer Graphics and CAD, NATO ASI Series F40, R.A. Earnshaw (Ed.), Springer-Verlag: Berlin, 1988, pp. 167-184.
14. G.R. Rajugopal and R.H.M. Hafez, "Adaptive rate controlled, robust video communication over packet wireless networks," Mobile Networks and Applications, vol. 3, pp. 33-47, 1998.
15. S. Sahni, "Algorithms for scheduling independent tasks," JACM, vol. 23, pp. 116-127, 1976.
16. F.C.R. Spieksma, "On the approximability of an interval scheduling problem," Journal of Scheduling, vol. 2, pp. 215-227, 1999. Preliminary version in the Proceedings of the APPROX'98 Conference, Lecture Notes in Computer Science, vol. 1444, pp. 169-180, 1998.
17. F.C.R. Spieksma, "On the approximability of an interval scheduling problem," Journal of Scheduling, vol. 2, pp. 215-227, 1999. Preliminary version in the Proceedings of the APPROX'98 Conference, Lecture Notes in Computer Science, vol. 1444, pp. 169-180, 1998.
18. D.K.Y. Yau and S.S. Lam, "Adaptive rate-controlled scheduling for multimedia applications," in Proc. IS&T/SPIE Multimedia Computing and Networking Conf., San Jose, CA, 1996.