The Community for Technology Leaders
2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (2012)
Shanghai, China China
May 21, 2012 to May 25, 2012
ISBN: 978-1-4673-0974-5
pp: 2470-2473
ABSTRACT
The rapid development of multi-core processors leads to a constantly increasing trend of deploying real-time systems on multi-core platforms, to satisfy the dramatically increasing high-performance and low-power requirements. This trend demands effective and efficient multiprocessor real-time scheduling techniques. The uniprocessor scheduling problem has been well studied during the last 40 years. However the multiprocessor scheduling problem to map tasks onto parallel architectures is a much harder challenge. In this work, we study several fundamental problems in multiprocessor scheduling, namely the critical instant, bounded responsiveness, and utilization bound.
INDEX TERMS
Real time systems, Job shop scheduling, Time factors, Scheduling algorithms, Multicore processing
CITATION

N. Guan and W. Yi, "Fixed-Priority Multiprocessor Scheduling: Critical Instant, Response Time and Utilization Bound," 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum(IPDPSW), Shanghai, China China, 2012, pp. 2470-2473.
doi:10.1109/IPDPSW.2012.305
171 ms
(Ver 3.3 (11022016))