Ada real-time systems and basic priority inheritance

Authors:
Loïc Briand
Affiliations:
Thomson-CSF SDC - Wilcox Electric, Inc., 2001 N.E. 64th Street, Kansas City, MO
Venue:
ACM SIGAda Ada Letters
Year:
1994

Citing 3
Cited 0

Limitations of Ada for real-time scheduling

IRTAW '87 Proceedings of the first international workshop on Real-time Ada issues
The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks

IRTAW '88 Proceedings of the second international workshop on Real-time Ada issues
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

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).