Fixed-Priority Multiprocessor Scheduling: Critical Instant, Response Time and Utilization Bound
2012 (English)In: 2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS & PHD FORUM (IPDPSW), 2012, 2470-2473 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
2012. 2470-2473 p.
, IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum-IPDPSW
IdentifiersURN: urn:nbn:se:uu:diva-185680DOI: 10.1109/IPDPSW.2012.305ISI: 000309409400318ISBN: 978-0-7695-4676-6OAI: oai:DiVA.org:uu-185680DiVA: diva2:572362
26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), MAY 21-25, 2012, Shanghai, PEOPLES R CHINA