Sökning: onr:"swepub:oai:DiVA.org:uu-185680" >
Fixed-Priority Mult...
Fixed-Priority Multiprocessor Scheduling : Critical Instant, Response Time and Utilization Bound
-
- Guan, Nan (författare)
- Uppsala universitet,Datorteknik
-
- Yi, Wang (författare)
- Uppsala universitet,Datorteknik
-
(creator_code:org_t)
- 2012
- 2012
- Engelska.
-
Ingår i: 2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS & PHD FORUM (IPDPSW). - 9780769546766 ; , s. 2470-2473
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas