Online real-time preemptive scheduling of jobs with deadlines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1913, Issue , 2000, Pages 96-107

  DasGupta, Bhaskar ^a   Palis, Michael A ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; REAL TIME SYSTEMS; SCHEDULING ALGORITHMS; SOCIAL NETWORKING (ONLINE); TELECOMMUNICATION NETWORKS;

OBJECTIVE FUNCTIONS; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; ON-LINE SCHEDULERS; OPTIMAL SCHEDULER; PERFORMANCE GUARANTEES; PRE-EMPTIVE SCHEDULING; REAL - TIME SCHEDULING;

SCHEDULING;

EID: 84937400681     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-44436-x_11     Document Type: Article

References (27)

1. Baruah, S., G. Koren, B. Mishra, A. Ragunathan, L. Rosier, and D. Sasha, On-line Scheduling in the Presence of Overload, Proc. 32nd IEEE Symposium on Foundations of Computer Science, 100-110, October 1991.
2. Baruah S., 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 4, 125-144, 1992.
3. Bar-Noy, A., R. Bar-Yehuda, A. Freund, J. S. Naor and B. Schieber, A Unified Approach to Approximating Resource Allocation and Scheduling, Proc. 32nd Annual ACM Symposium on Theory of Computing, 735-744, May 2000.
4. Bar-Noy, A., S. Guha, J. S. Naor and B. Schieber, Approximating the throughput of multiple machines in real-time scheduling, Proc. 31st Annual ACM Symposium on Theory of Computing, 622-631, 1999.
5. Berman P. and B. DasGupta, Improvements in Throughput Maximization for Real- Time Scheduling, Proc. 32nd Annual ACM Symposium on Theory of Computing, 680-687, May 2000.
6. Becchetti, L., S. Leonardi and S. Muthukrishnan, Scheduling to Minimize Average Stretch without Migration, Proc. 11thA nnual ACM-SIAM Symp. on Discrete Algorithms, 548-557, 2000.
7. Bender, M., S. Chakrabarti and S. Muthukrishnan, Flowan d Stretch Metrics for Scheduling Continuous Job Streams, Proc. 10thA nnual ACM-SIAM Symp. on Discrete Algorithms, 1999.
8. Brandt, S., G. Nutt, T. Berk, and M. Humphrey, Soft Real-Time Application Execution with Dynamic Quality of Service Assurance, 1998 International Workshop on Quality of Service, 154-163, May 1998.
9. Compton, C. and D. Tennenhouse, Collaborative Load Shedding, Proc. Workshop on the Role of Real-Time in Multimedia/Interactive Computing Systems, Dec. 1993.
10. Dertouzos, M., Control Robotics: the Procedural Control of Physical Processors, Proc. IFIP Congress, 807-813, 1974.
11. Fan, C., Realizing a Soft Real-Tim Framework for Supporting Distributed Multimedia Applications, Proc. 5th IEEE Workshop on the Future Trends of Distributed Computing Systems, 128-134, August 1995.
12. Humphrey, M., T. Berk, S. Brandt, and G. Nutt, 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, 97-104, Dec. 1997.
13. Jones, M., J. Barbera III, and A. Forin, An Overviewo f the Rialto Real-Time Architecture, Proc. 7thA CM SIGOPS European Workshop, 249-256, Sept. 1996.
14. Jones, M., D. Rosu, and M.-C. Rosu, CPU Reservations and Time Constraints: Efficient, Predictable Scheduling of Independent Activities, Proc. 16thA CM Symposium on Operating Systems Principles, Oct. 1997.
15. Kise H., T. Ibaraki and H. Mine, A solvable case of one machine scheduling problems with ready and due dates, Operations Research 26, 121-126, 1978.
16. Koren G. and D. Shasha, An optimal on-line scheduling algorithm for overloaded real-time systems, SIAMJ. on Computing 24, 318-339, 1995.
17. Lawler, E. L., A dynamic programming approach for preemptive scheduling of a single machine to minimize the number of late jobs, Annals of Operations Research 26, 125-133, 1990.
18. Lipton, R. J. and A. Tomkins, Online interval scheduling, Proc. 5thA nnual ACMSIAM Symp. on Discrete Algorithms, 302-311, 1994.
19. Liu, H. and M. E. Zarki, Adaptive source rate control for real-time wireless video transmission, Mobile Networks and Applications 3, 49-60, 1998.
20. Mok, A., Fundamental Design Problems of Distributed Systems for the Hard Real- Time Environment, Doctoral Dissertation, M.I.T., 1983.
21. Muthukrishnan, S., R. Rajaraman, A. Shaheen abd J. E. Gehrke, Online Scheduling to Minimize Average Stretch, Proc. 40thAnn ual IEEE Symp. on Foundations of Computer Science, 433-443, 1999.
22. Nieh, J. and M. Lam, The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications, Proc. 16thA CM Symposium on Operating Systems Principles, Oct. 1997.
23. Nieh, J. and M. Lam, Integrated Processor Scheduling for Multimedia, Proc. 5th International Workshop on Network and Operating System Support for Digital Audio and Video, April 1995.
24. Rajugopal, G. R. and R. H. M. Hafez, Adaptive rate controlled, robust video communication over packet wireless networks, Mobile Networks and Applications 3, 33-47, 1998.
25. Sahni, S, Algorithms for scheduling independent tasks, JACM 23, 116-127, 1976.
26. Spieksma, F. C. R., On the approximability of an interval scheduling problem, Journal of Scheduling 2, 215-227, 1999 (preliminary version in the Proceedings of the APPROX’98 Conference, Lecture Notes in Computer Science, 1444, 169-180, 1998).
27. Yau, D. K. Y. and S. S. Lam, Adaptive rate-controlled scheduling for multimedia applications, Proc. IS&T/SPIEMultimedia Computing and Networking Conf., San Jose, CA, January 1996.