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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012 |
| Pages | 2470-2473 |
| Number of pages | 4 |
| DOIs | |
| Publication status | Published - 18 Oct 2012 |
| Externally published | Yes |
| Event | 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012 - Shanghai, China Duration: 21 May 2012 → 25 May 2012 |
Conference
| Conference | 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012 |
|---|---|
| Country/Territory | China |
| City | Shanghai |
| Period | 21/05/12 → 25/05/12 |
ASJC Scopus subject areas
- Software