The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments

IEEE Transactions on Computers

Volumn 44, Issue 1, 1995, Pages 73-91

  Strosnider, Jay K ^a   Lehoczky, John P ^a   Sha, Lui ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; OPTIMIZATION; PERFORMANCE; REAL TIME SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING; TIME DIVISION MULTIPLEXING;

APERIODICS; APERIODIODIC RESPONSIVENESS; DEFERRABLE SERVER ALGORITHM; HARD DEADLINES; PERIODICS; SCHEDULABILITY;

ALGORITHMS;

EID: 0029230309     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.368008     Document Type: Article

References (14)

1. J. P. Lehoczky, “Fixed priority scheduling of periodic task sets with arbitrary deadlines,” in Proc. 11th IEEE Real-Time Syst. Symp., 1990, pp. 201-209.
2. C. L. Liu and J. W. Layland, “Scheduling algorithms for multiprogramming in a hard real-time environment,” JACM, vol. 20, no. 1, pp. 46-61, 1973.
3. J. Liu, C. L. Liu, and L. Liestman, “Scheduling with slack time,” Acta lnformatica, vol. 17, pp. 31-41, 1982.
4. J. Y. Leung and M. L. Merrill, “A note on preemptive scheduling of periodic, real-time tasks,” Inform. Processing Lett., vol. 11, no. 3, pp. 115-118, Nov. 1980.
5. E. L. Lawler and C. U. Martel, “Scheduling periodically occurring tasks on multiprocessors,” Inform. Processing Lett., vol. 12, no. 1, pp. 9-12, Feb. 1981.
6. J. P. Lehoczky, L. Sha, and Y. Ding, “The rate monotonic scheduling algorithm: exact characterization and average case behavior,” in Proc. 10th IEEE Real-Time Syst. Symp., 1989, pp. 166-171.
7. J. P. Lehoczky, L. Sha, J. K. Strosnider, and H. Tokuda, “Fixed priority scheduling theory for hard real-time systems,” in Foundations of Real-Time Computing: Scheduling and Resource Management, A.M. van Tilborg and G. M. Koob, Eds. New York: Kluwer Academic, 1991, pp. 1-30.
8. A. K. Mok, “Fundamental Design problems of distributed systems for the hard real-time environment,” Ph.D. thesis, M.I.T., 1983.
9. L. Sha, J. P. Lehoczky, and R. Rajkumar, “Solutions for some practical problems in prioritized preemptive scheduling,” in Proc. 7th IEEE Real-Time Syst. Symp., 1986, pp. 181-191.
10. J. K. Strosnider and T. Marchok, “Responsive, deterministic ieee 802.5 token ring scheduling,” Real-Time Syst. J., pp. 133-158, Sept. 1989.
11. B. Sprunt, “Aperiodic task scheduling for real-time systems,” Ph.D. thesis, Carnegie Mellon Univ., Aug. 1990.
12. J. K. Stronsnider, “Highly responsive real-time token rings,” Ph.D. thesis, Carnegie Mellon Univ., Aug. 1988.
13. “Enhanced responsiveness protocol for real-time token rings,” Tech. Rep. CMU-90-1, Carnegie Mellon Univ., Jan. 1990.
14. M. Joseph and P. Pandya, “Finding response times in a real-time system,” Comput. J., vol. 29, no. 5, pp. 390-394, 1986.