Ada real-time systems and basic priority inheritance-Reference-Cited by-同舟云学术

Ada real-time systems and basic priority inheritance

Published:1994-05 Issue:3 Volume:XIV Page:105-112
ISSN:1094-3641
Container-title:ACM SIGAda Ada Letters
language:en
Short-container-title:Ada Lett.

Author:

Briand Loïc¹

Affiliation:

1. Thomson-CSF SDC - Wilcox Electric, Inc., 2001 N.E. 64th Street, Kansas City, MO

Abstract

The Rate Monotonic Scheduling theory is often presented as the ultimate means for improving dramatically and easily the schedulability of Ada Real-Time systems. To assess its practical impact on Real-Time systems, the behavior of a hard-deadline simulated task set is statstically analyzed in different contexts of scheduling (standard Ada FIFO scheduling or basic priority inheritance) and priority allocation (higher priority to the shorter deadline or to the shorter period).

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/181468.181475

Reference4 articles.

1. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

2. 3 . J. B. Goodenough and L. Sha "The Priority Ceiling Protocol: A Method for Minimizing the Blocking of High Priority Ada Tasks " The 2nd International Workshop on Real-Time Issues May 1988. 10.1145/58612.59371 3. J. B. Goodenough and L. Sha "The Priority Ceiling Protocol: A Method for Minimizing the Blocking of High Priority Ada Tasks " The 2nd International Workshop on Real-Time Issues May 1988. 10.1145/58612.59371

3. 4 . D. Cornhill L. Sha J. P. Lehoczki R. Rajkumar and H. Tokuda: "Limitations of Ada for Real-Time Scheduling " Proceedings of First International Workshop on Real-Time Ada Issues 1987. 10.1145/36821.36798 4. D. Cornhill L. Sha J. P. Lehoczki R. Rajkumar and H. Tokuda: "Limitations of Ada for Real-Time Scheduling " Proceedings of First International Workshop on Real-Time Ada Issues 1987. 10.1145/36821.36798