Parametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling
2012 (English)In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium (IPDPS), 2012, 261-272 p.Conference paper (Refereed)
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 Layland 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.
Place, publisher, year, edition, pages
2012. 261-272 p.
, International Parallel and Distributed Processing Symposium IPDPS
Engineering and Technology
IdentifiersURN: urn:nbn:se:uu:diva-184746DOI: 10.1109/IPDPS.2012.33ISI: 000309131900024ISBN: 978-0-7695-4675-9OAI: oai:DiVA.org:uu-184746DiVA: diva2:567887
26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), MAY 21-25, 2012, Shanghai, PEOPLES R CHINA