Abstract
Cache memories have been introduced into embedded systems to prevent memory access times from becoming an unacceptable performance bottleneck. Memory and cache are split into blocks containing instructions and data. During a pre-emption, blocks from the pre-empting task can evict those of the pre-empted task. When the pre-empted task is resumed, if it then has to re-load the evicited blocks, cache related pre-emption delays (CRPD) are introduced which then affect schedulability of the task. In this paper, we show how existing approaches for calculating CRPD for FP scheduling can be adapted and integrated into schedulability analysis for EDF. We then compare the performance of the different approaches against an existing approach for calculating CRPD for EDF. Using a case study and empirical evaluation, we show the benefits of our CRPD analysis.
| Original language | English |
|---|---|
| Title of host publication | Real-Time Applications and Embedded Technology Symposium (RTAS) |
| Publisher | IEEE |
| Pages | 75-84 |
| ISBN (Electronic) | 978-1-4799-0185-2 |
| ISBN (Print) | 978-1-4799-0186-9 |
| DOIs | |
| Publication status | Published - Apr 2013 |
| Event | Real-Time and Embedded Technology and Applications Symposium (RTAS), 2013 IEEE 19th - Philadelphia, United States Duration: 9 Apr 2013 → 11 Apr 2013 |
Conference
| Conference | Real-Time and Embedded Technology and Applications Symposium (RTAS), 2013 IEEE 19th |
|---|---|
| Country/Territory | United States |
| City | Philadelphia |
| Period | 9/04/13 → 11/04/13 |
Keywords
- cache related preemption delay
- CRPD
- EDF scheduling
- schedulability analysis
- real-time