The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2012)
Shanghai, China China
May 21, 2012 to May 25, 2012
ISSN: 1530-2075
ISBN: 978-1-4673-0975-2
pp: 261-272
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.
INDEX TERMS
Program processors, Harmonic analysis, Partitioning algorithms, Algorithm design and analysis, Time factors, Scheduling algorithms, utilization bound, real-time systems, fixed-priority scheduling, multiprocessor
CITATION

W. Yi, M. Stigge, N. Guan and G. Yu, "Parametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling," Parallel and Distributed Processing Symposium, International(IPDPS), Shanghai, China China, 2012, pp. 261-272.
doi:10.1109/IPDPS.2012.33
197 ms
(Ver 3.3 (11022016))