Efficient real-time scheduling algorithms for multiprocessor systems

IEICE Transactions on Communications

Volumn E85-B, Issue 12, 2003, Pages 2859-2867

  Cho, Seongje ^a   Lee, Suk Kyoon ^b   Anh, Sang ^c   Lin, Kwei Jay ^c  

^a Dankook University   (South Korea)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c University of California at Irvine   (United States)

Author keywords

Earliest deadline zero laxity; Earliest deadline least laxity; Multiprocessor; Real time scheduling

Indexed keywords

MULTIPROCESSING SYSTEMS; REAL TIME SYSTEMS; SCHEDULING; SERVERS;

EARLIEST DEADLINE FIRST ALGORITHM; LEAST LAXITY ALGORITHM; MULTIPROCESSOR SYSTEMS; REAL-TIME SCHEDULING ALGORITHMS;

ALGORITHMS;

EID: 0037287966     PISSN: 09168516     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. R. Clark, Scheduling dependent real-time activities, PhD Thesis, Computer Science Department, Carnegie-Mellon University, 1990.
2. S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha, "On-line scheduling in the presence of overload," 1991 IEEE Symposium on Foundations of Computer Science, pp.100-110, Oct. 1991.
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 task Scheduling," Proc. 12th Real-Time Systems Symp., pp. 106-115, Dec. 1991.
4. C.D. Locke, Best-effort decision making for real-time scheduling, PhD Thesis, Computer Science Department, Carnegie-Mellon University, 1986.
5. C. Liu and J. Layland, "Scheduling algorithms for multi-programming in a hard real-time environment," J. ACM, vol.20, no.1, pp.46-61, 1973.
6. M.L. Dertouzos and A.K. Mok, "Multiprocessor on-line scheduling of hard-real-time tasks," IEEE Trans. Software Eng., vol.15, no.12, pp.1497-1506, Dec. 1989.
7. J.Y.-T. Leung, "A new algorithm for scheduling periodic, real-time tasks," Algorithmica, vol.4, pp.209-219, 1989.
8. S.K. Lee and D. Epley, "On-line scheduling algorithms of real-time sporadic tasks in multiprocessor systems," Technical Report 92-3, Computer Science, University of Iowa, 1992.
9. S.K. Lee, "On-line multiprocessor scheduling algorithms for real-time tasks," Proc. IEEE Region 10's Ninth Annual International Conf., pp. 607-611, Aug. 1994.
10. H. Chetto and M. Chetto, "Some results of the earliest deadline scheduling algorithm," IEEE Trans. Software Eng., vol.15, no.10, pp.1261-1269, Oct. 1989.
11. I. Ripoll, A. Crespo, and A. Garcia-Fornes, "An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems," IEEE Trans. Software Eng., vol.23, no.6, pp.388-400, June 1997.
12. K. Jeffay, "Scheduling sporadic tasks with shared resources in hard-real-time systems," Proc. 13th IEEE Real-Time Systems Symp., pp.89-99, Dec. 1992.
13. S. Baruah, N. Cohen, C.G. Plaxton, and D. Varvel, "Proportionate progress: A notion of fairness in resource allocation," Algorithmica, vol.15, pp.600-625, 1996.
14. S. Baruah, J. Gehrke, and C.G. Plaxton, "Fast scheduling of periodic tasks on multiple resources," Proc. 9th International Parallel Processing Symp., pp.280-288, 1995.
15. A. Srinivasan and S. Baruah, "Deadline-based scheduling of periodic task systems on multiprocessors," Inf. Process. Lett., vol.84, no.2, pp.93-98, Oct. 2002. (http://www.cs.unc/edu/barauh/Papers/Publications).
16. A. Chandra, M. Adler, and P. Shenoy, "Deadline fair scheduling: Bridging the theory and practice of proportionate-fair scheduling in multiprocessor systems." Proc. IEEE Real-time Technology and Applications Symposium (RTAS), 2001.
17. J. Stankovic, "Real-time computing," Byte, vol.17, no.8, pp.155-160, Aug. 1992.