Effective Analysis for Engineering Real-Time Fixed Priority Schedulers

IEEE Transactions on Software Engineering

Volumn 21, Issue 5, 1995, Pages 475-480

  Burns, Alan ^a   Wellings, Andy ^a   Tindell, Ken ^b  

^a UNIVERSITY OF YORK   (United Kingdom)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

aerospace; Implementation; kernel; operating system; overheads; scheduling

Indexed keywords

EID: 84884366383     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.387477     Document Type: Article

References (17)

1. N. Audsley, A. Burns, R. Davis, K. Tindell, and A. Wellings, “Fixed priority scheduling: An historical perspective,” Real-Time Systems, vol. 8, no. 2/3, pp. 129-154, Mar. 1995.
2. A. Burns, “Preemptive priority based scheduling: An appropriate engineering approach,” in Advances in Real-Time Systems, S.H. Son, ed. Prentice Hall, pp. 225-248, 1993.
3. D. Katcher, H. Arakawa, and J. Strosnider, “Engineering and analysis of fixed priority schedulers,” IEEE Trans. on Software Engineering, vol. 19, no. 9, Sept. 1993.
4. C. Bailey, E. Fyfe, T. Vardanega, and A. Wellings, “The use of preemptive priority-based scheduling for space applications,” Proc. Real-Time Systems Symp., pp. 253-257, Dec. 1993.
5. A. Burns, A. Wellings, C. Bailey, and E. Fyfe, The Olympus Attitude and Orbital Control System: A Case Study in Hard Real-Time System Design and Implementation,” Dept. of Computer Science, Univ. of York, England, 1993.
6. York Software Engineering Ltd., York Ada Compiler Environment (York ACE) Reference Guide, 1991.
7. Intermetrics, Inc., Ada 9X Reference Manual. Draft. Ver. 5.99, Dec. 1994.
8. C. Locke, D. Vogel, and T. Mesler, “Building a predictable avionics platform in Ada: A case study,” Proc. Real-Time Systems Symp., Dec. 1991.
9. M. Joseph and P. Pandya, “Finding response times in a real-time system,” The Computer J., vol. 29, no. 5, pp. 390-395, Oct. 1986.
10. N. Audlsey, A. Burns, A. Richardson, and A. Wellings, “Hard real-time scheduling: The deadline monotonic approach,” IEEE Workshop on Real-Time Operating Systems and Software, May 1991.
11. L. Sha, R. Rajkumar, and J. Lehoczky, “Priority inheritance protocols: An approach to real-time synchronisation,” IEEE Trans. on Computers, vol. 39, no. 9, pp. 1,175-1,185, Sept. 1990.
12. J. Leung and J. Whitehead, “On the complexity of fixed-priority scheduling of periodic real-time tasks,” Performance Evaluation, vol. 2, no. 4, pp. 237-250, Dec. 1980.
13. N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings, “Applying new scheduling theory to static priority preemptive scheduling, Software Eng. J., vol. 8, no. 5, pp. 284-292, Sept. 1993.
14. A. Burns, A. Wellings, and A. Hutcheon, “The impact of an Ada runtime system's performance characteristics on scheduling models,” Proc. 12th Ada-Europe Conf., 1993.
15. C. Liu and J. Layland, “Scheduling algorithms for multiprogramming in a hard-real-time environment,” JACM, vol. 20, no. 1, pp. 46-61, 1973.
16. T. Mesler, Private communication, Jan. 1992.
17. R. Rajkumar, “Real-time synchronization protocols for shared memory multiprocessors,” Proc. 10th IEEE Int'l Conf. Distributed Computing, Paris, May 1990.