Sökning: id:"swepub:oai:research.chalmers.se:e3e2a0e4-0a46-4760-8d88-d8a09fa5fe68" >
Static-Priority Sch...
Static-Priority Scheduling on Multiprocessors
-
- Andersson, Björn (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
Baruah, Sanjoy (författare)
-
- Jonsson, Jan, 1962 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
(creator_code:org_t)
- ISBN 0769514200
- 2001
- 2001
- Engelska.
-
Ingår i: Proceedings of the IEEE Real-Time Systems Symposium, December 3−6, 2001, London, England. - 0769514200 ; , s. 193−202-
- Relaterad länk:
-
https://research.cha...
Abstract
Ämnesord
Stäng
- The preemptive scheduling of systems of periodic tasks on a platform comprised of several identical processors is considered. A scheduling algorithm is proposed for static-priority scheduling of such systems; this algorithm is a simple extension of the uniprocessor rate-monotonic scheduling algorithm. It is proven that this algorithm successfully schedules any periodic task system with a worst-case utilization no more than a third the capacity of the multiprocessor platform. It is also shown that no static-priority multiprocessor scheduling algorithm (partitioned or global) can guarantee schedulability for a periodic task set with a utilization higher than one half the capacity of the multiprocessor platform.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datorteknik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Engineering (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- partitioned scheduling
- preemptive scheduling
- fixed-priority scheduling
- multiprocessor systems
- Dhall's effect
- Real-time scheduling
- global scheduling
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas