Online real-time preemptive scheduling of jobs with deadlines on multiple machines

Journal of Scheduling

Volumn 4, Issue 6, 2001, Pages 297-312

  Gupta, Bhaskar Das ^a,b   Palis, Michael A ^a  

^a RUTGERS UNIVERSITY   (United States)

^b 1120 Science and Engineering Offices   (United States)

Author keywords

Approximation algorithms; Online algorithms; Real time scheduling

Indexed keywords

EID: 0009982462     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.85     Document Type: Article

References (28)

1. Brandt S, Nutt G, Berk T, Humphrey M. Soft real-time application execution with dynamic quality of service assurance. 1998 International Workshop on Quality of Service, May 1998; 154-163.
2. Compton C, Tennenhouse D. Collaborative load shedding. Proceedings of the Workshop on the role of real-time in multimedia/interactive computing systems, December 1993.
3. Fan C. Realizing a soft real-time framework for supporting distributed multimedia applications. Proceedings of the 5th IEEE Workshop on the Future Trends of Distributed Computing Systems, August 1995; 128-134.
4. Humphrey M, Berk T, Brandt S, Nutt G. Dynamic quality of service resource management for multimedia applications on general purpose operating systems. IEEE Workshop in Middleware for Distributed Real-Time Systems and Services, December 1997; 97-104.
5. Jones M, Barbera III J, Forin A. An overview of the Rialto real-time architecture. Proceedings of the 7th ACM SIGOPS European Workshop, September 1996; 249-256.
6. Jones M, Rosu D, Rosu M-C. CPU Reservations and time constraints: efficient, predictable scheduling of independent activities. Proceedings of the 16th ACM Symposium on Operating Systems Principles, October 1997.
7. Liu H, Zarki ME. Adaptive source rate control for real-time wireless video transmission. Mobile-Networks and Applications 1998; 3:49-60.
8. Nieh J, Lam M. The design, implementation and evaluation of SMART: a scheduler for multimedia applications. Proceedings of the 16th ACM Symposium on Operating Systems Principles, October 1997.
9. Nieh J, Lam M. Integrated processor scheduling for multimedia. Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video, April 1995.
10. Rajugopal GR, Hafez RHM. Adaptive rate controlled, robust video communication over packet wireless networks. Mobile Networks and Applications 1998; 3:33-47.
11. Yau DKY, Lam SS. Adaptive rate-controlled scheduling for multimedia applications. Proceedings of the IS&T/SPIE Multimedia Computing and Networking Conference, San Jose, CA, January 1996.
12. Mok A. Fundamental design problems of distributed systems for the hard real-time environment. Doctoral Dissertation, M.I.T., 1983.
13. Baruah S, Keren G, Mishra B, Ragunathan A, Rosier L, Sasha D. On-line scheduling in the presence of overload. Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, October 1991; 100-110.
14. Lipton RJ, Tomkins A. Online interval scheduling. Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, 1994; 302-311.
15. Becchetti L, Leonardi S, Muthukrishnan S. Scheduling to minimize average stretch without migration. Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000; 548-557.
16. Bender M, Chakrabarti S, Muthukrishnan S. Flow and stretch metrics for scheduling continuous job streams. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999.
17. Muthukrishnan S, Rajaraman R, Shaheen abd A, Gehrke JE. Online scheduling to minimize average stretch, Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science 1999; 433-443.
18. Bar-Noy A, Guha S, Naor JS, Schieber B. Approximating the throughput of multiple machines in real-time scheduling. Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999; 622-631.
19. Sahni S. Algorithms for scheduling independent tasks. JACM 1976; 23:116-127.
20. Lawler EL. A dynamic programming approach for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research 1990; 26:125-133.
21. Kisc H, Ibaraki T, Mine H. A solvable case of one machine scheduling problems with ready and due date. Operations Research 1978; 26:121-126.
22. Bar-Noy A, Bar-Yehuda R, Freund A, Naor JS, Schieber B. A unified approach to approximating resource allocation and scheduling. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, May 2000; 735-744.
23. Berman P, DasGupta B. Improvements in throughput maximization for real-time scheduling. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, May 2000; 680-687.
24. Spieksma FCR. On the approximability of an interval scheduling problem. Journal of Scheduling 1999; 2:215-227. (preliminary version in the Proceedings of the APPROX'98 Conference. Lecture Notes in Computer Science, vol. 1444. Springer: Berlin, 1998; 169-180).
25. Spieksma FCR. On the approximability of an interval scheduling problem. Journal of Scheduling 1999; 2:215-227. (preliminary version in the Proceedings of the APPROX'98 Conference. Lecture Notes in Computer Science, vol. 1444. Springer: Berlin, 1998; 169-180).
26. Baruah S, Koren G, Mao D, Mishra B, Raghunathan A, Rosier L, Shasha D, Wang F. On the competitiveness of on-line real-time scheduling. Real-Time Systems 1992; 4:125-144.
27. Koren G, Shasha D. An optimal on-line scheduling algorithm for overloaded real-time systems. SIAM Journal on Computing 1995; 24:318-339.
28. Dertouzos M. Control robotics: the procedural control of physical processors. Proceedings of IFIP Congress, 1974; 807-813.