Abstract
Future embedded real-time systems will be deployed on multi-core processors to meet the dramatically increasing high-performance and low-power requirements. This trend appeals to generalize established results on uniprocessor scheduling, particularly the various utilization bounds for schedulability test used in system design, to the multiprocessor setting. Recently, this has been achieved for the famous Liu and Lay land utilization bound by applying novel task splitting techniques. However, parametric utilization bounds that can guarantee higher utilizations (up to 100%) for common classes of systems are not yet known to be generalizable to multiprocessors as well. In this paper, we solve this problem for most parametric utilization bounds by proposing new task partitioning algorithms based on exact response time analysis. In addition to the worst-case guarantees, as the exact response time analysis is used for task partitioning, our algorithms significantly improve average-case utilization over previous work.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium, IPDPS 2012 |
| Pages | 261-272 |
| Number of pages | 12 |
| DOIs | |
| Publication status | Published - 4 Oct 2012 |
| Externally published | Yes |
| Event | 2012 IEEE 26th International Parallel and Distributed Processing Symposium, IPDPS 2012 - Shanghai, China Duration: 21 May 2012 → 25 May 2012 |
Conference
| Conference | 2012 IEEE 26th International Parallel and Distributed Processing Symposium, IPDPS 2012 |
|---|---|
| Country/Territory | China |
| City | Shanghai |
| Period | 21/05/12 → 25/05/12 |
Keywords
- fixed-priority scheduling
- multiprocessor
- real-time systems
- utilization bound
ASJC Scopus subject areas
- Software