Sökning: id:"swepub:oai:DiVA.org:mdh-9592" >
Partitioning Real-T...
Partitioning Real-Time Systems on Multiprocessors with Shared Resources
-
- Nemati, Farhang (författare)
- Mälardalens högskola,Akademin för innovation, design och teknik,MRTC,Mälardalen Real-Time Research Centre, Västerås, Sweden
-
- Nolte, Thomas (författare)
- Mälardalens högskola,Akademin för innovation, design och teknik,MRTC,Mälardalen Real-Time Research Centre, Västerås, Sweden
-
- Behnam, Moris (författare)
- Mälardalens högskola,Akademin för innovation, design och teknik,MRTC,Mälardalen Real-Time Research Centre, Västerås, Sweden
-
(creator_code:org_t)
- Berlin, Heidelberg : Springer, 2010
- 2010
- Engelska.
-
Ingår i: Lecture Notes in Computer Science, vol. 6490. - Berlin, Heidelberg : Springer. - 9783642176524 - 9783642176531 ; , s. 253-269
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- There are two main approaches to task scheduling on multiprocessor/multi-core platforms; 1) global scheduling, under which migration of tasks among processors is allowed, and 2) partitioned scheduling under which tasks are allocated onto processors and task migration is not allowed. Under global scheduling a higher utilization bound can be achieved, but in practice the overheads of migrating tasks is high. On the other hand under partitioned scheduling, besides simplicity and efficiency, existing scheduling and synchronization methods developed for uniprocessor platforms can more easily be extended to partitioned scheduling. However the partitioned scheduling protocols suffer from the problem of partitioning tasks among processors/cores which is a bin-packing problem. Therefore, several heuristic algorithms have been developed for partitioning a task set on multiprocessor platforms. However, these algorithms typically assume independent tasks while in practice real-time systems often contain tasks that share resources and hence may block each other.In this paper we propose a blocking-aware partitioning algorithm which allocates a task~set onto processors in a way that the overall amount of blocking times of tasks are decreased. The algorithm reduces the total utilization which, in turn, has the potential to decrease the total number of required processors (cores). In this paper we evaluate our algorithm and compare it with an existing similar algorithm. The comparison criteria includes both number of schedulable systems as well as processor reduction performance.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kap (ämneskategori)
Hitta via bibliotek
Till lärosätets databas