Scheduling fixed-priority tasks with preemption threshold

Proceedings - 6th International Conference on Real-Time Computing Systems and Applications, RTCSA 1999

Volumn , Issue , 1999, Pages 328-335

  Wang, Yun ^a   Saksena, M ^a  

^a Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER OPERATING SYSTEMS; REAL TIME SYSTEMS; SCHEDULING ALGORITHMS;

FIXED PRIORITY SCHEDULING; GENERALIZED MODELS; NONPREEMPTIVE SCHEDULING; OPTIMAL ASSIGNMENT; PRE-EMPTIVE SCHEDULING; PREEMPTION THRESHOLDS; REAL TIME OPERATING SYSTEM; SCHEDULING MODELS;

SCHEDULING;

EID: 84988635832     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTCSA.1999.811269     Document Type: Conference Paper

References (11)

1. N. Audsley. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Technical Report YCS 164, Department of Computer Science, University of York, England, Dec. 1991.
2. A. Bums and A. J. Wellings. A practical method for increasing processor utilization. In Proceedings, 5th Euromicro Workshop on Real-Time Systems, June 1993.
3. L. George, N. Rivierre, and M. Spuri. Preemptive and nonpreemptive real-Time uni-processor scheduling. Technical Report No 2966, INRIA, France, sep 1996.
4. M. Harbour, M. Klein, and J. Lehoczky. Fixed Priority Scheduling of Periodic Tasks with Varying Execution Priority. In Proceedings, IEEE Real-Time Systems Symposium, pages 1 16-1 28, December 199 1.
5. M. Joseph and P. Pandya. Finding response times in a realtime system. Cornputer Journal, 29(5):390-395, 1986.
6. W. Lamie. Preemption-Threshold. White Paper, Express Logic Inc. Available at http://www.threadx.codpreemption.html.
7. J. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In Proceedings of IEEE Real-Time Sysrems Symposium, pages 201-209. IEEE Computer Society Press, Dec. 1990.
8. [SI J. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proceedings of IEEE Real-Time Systems Symposium, pages 166-171. IEEE Computer Society Press, Dec. 1989.
9. J. Leung and J. Whitehead. On the complexity of fixedpriority scheduling of periodic, real-Time tasks. Performance Evaluation, 2:237-250, 1982.
10. C. Liu and J. Layland. Scheduling algorithm for multiprogramming in a hard real-Time environment. Journal of the ACM, 20(1):46-61, Jan. 1973.
11. K. Tindell, A. Bums, and A. Wellings. An extendible approach for analysing fixed priority hard real-Time tasks. The Journal of Real-Time Systems, 6(2): 133-1 52, Mar. 1994.