Non-preemptive fixed priority scheduling of hard real-time periodic tasks

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

Volumn 4490 LNCS, Issue PART 4, 2007, Pages 881-888

  Park, Moonju ^a  

^a IBM Korea   (South Korea)

Author keywords

Non preemptive; Periodic tasks; Rate monotonic; Real time scheduling; Utilization bound

Indexed keywords

EMBEDDED SYSTEMS; REAL TIME SYSTEMS;

NON-PREEMPTIVE SYSTEMS; REAL-TIME PERIODIC TASKS;

SCHEDULING ALGORITHMS;

EID: 38149028467     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72590-9_134     Document Type: Conference Paper

References (12)

1. N.C. Audsley. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Technical report, Department of Computer Science, University of York, 1991.
2. N.C. Audsley, A. Burns, M. Richardson, and A. Wellings. Hard real-time scheduling: The deadline monotonic approach. In Proceedings of IEEE Workshop on Real-Time Operating Systems and Software, pages 133-137, May 1991.
3. T.P. Baker. A stack-based allocation policy for real-time processes. In Proceedings of IEEE Real-Time Systems Symposium, pages 191-200, December 1990.
4. L. George, N. Riviere, and M. Spuri. Preemptive and non-preemptive real-time uniprocessor scheduling. Technical report, INRIA, 1996.
5. K. Jeffay, D.F. Stanat, and C.U. Martel. On non-preemptive scheduling of periodic and sporadic tasks. In Proceedings of IEEE Real-Time Systems Symposium, pages 129-139, December 1991.
6. S. Lauzac and D. Mossé R. Melhem. An improved rate-monotonic admission control and its applications. IEEE Transactions on Computers, 52(3):337-350, 2003.
7. J.P. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In Proceedings of IEEE Real-Time Systems Symposium, pages 201-209, 1990.
8. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of ACM, 20(1):46-61, 1973.
9. W.-C. Lu, H.-W. Wei, and K.-J. Lin. Rate monotonic schedulability conditions using relative period ratios. In Proceedings of IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pages 3-9, August 2006.
10. T. M. Parks and E. A. Lee. Non-preemptive real-time scheduling of dataflow systems. In Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, pages 3225-3238, May 1995.
11. L. Sha, R. Rajkumar, and J. Lehoczky. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers, 39(9):1175-1185, 1990.
12. M. Spuri. Analysis of deadline scheduled real-time systems. Technical report, INRIA, 1996.