Abstract
An exact schedulability test of Accumulatively Monotonic (AM) multiframe tasks executing on a uniprocessor according to the fixed priority scheduling scheme is presented in this paper. The test is given as an analysis of the worst case response time of each AM multiframe task. This analysis is given in two stages, firstly we give the basic formula of the worst case response time of an AM multiframe task. Secondly, we extend this formula to include blocking time. An evaluation of this analysis is given as a comparison between this exact schedulability analysis and the most recent published, but non-optimal, schedulability analysis.
| Original language | English |
|---|---|
| Title of host publication | THEORETICAL ASPECTS OF COMPUTING - ICTAC 2008, PROCEEDINGS |
| Editors | JS Fitzgerald, AE Haxthausen, H Yenigun |
| Place of Publication | BERLIN |
| Publisher | Springer |
| Pages | 410-424 |
| Number of pages | 15 |
| Volume | 5160 LNCS |
| ISBN (Print) | 978-3-540-85761-7 |
| Publication status | Published - 2008 |
| Event | 5th International Colloquium on Theoretical Aspects of Computing (ICTAC 2008) - Istanbul Duration: 1 Sept 2008 → 3 Sept 2008 |
Conference
| Conference | 5th International Colloquium on Theoretical Aspects of Computing (ICTAC 2008) |
|---|---|
| City | Istanbul |
| Period | 1/09/08 → 3/09/08 |
Keywords
- INHERITANCE PROTOCOLS
- SYSTEM