Abstract
Fixed-priority scheduling has become a very important approach for implementing real-time systems. Two key aspects of the method are its support for resource management using priority inheritance protocols and its ability to model modes of operation. In this paper, we discuss the impact of mode changes on the immediate inheritance priority ceiling protocol. We show that the approach adopted in Ada can result in an increased blocking time for tasks that can unnecessarily jeopardise their schedulability. We propose several solutions to help solve this problem.
Original language | English |
---|---|
Title of host publication | RELIABLE SOFTWARE TECHNOLOGIES - ADA-EUROPE' 99 |
Editors | MG Harbour, JA DelaPuente |
Place of Publication | BERLIN |
Publisher | Springer |
Pages | 275-286 |
Number of pages | 12 |
ISBN (Print) | 3-540-66093-3 |
Publication status | Published - 1999 |
Event | 4th International Conference on Reliable Software Technologies (Ada-Europe'99) - SANTANDER Duration: 7 Jun 1999 → 11 Jun 1999 |
Conference
Conference | 4th International Conference on Reliable Software Technologies (Ada-Europe'99) |
---|---|
City | SANTANDER |
Period | 7/06/99 → 11/06/99 |