Search: id:"swepub:oai:research.chalmers.se:cb45b3d4-e7a6-48ef-aa2e-a2e12eab7246" >
Global Priority-Dri...
Global Priority-Driven Aperiodic Scheduling on Multiprocessors
-
- Andersson, Björn, 1974 (author)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Abdelzaher, T. (author)
- University of Virginia
-
- Jonsson, Jan, 1962 (author)
- Chalmers tekniska högskola,Chalmers University of Technology
-
(creator_code:org_t)
- ISBN 0769519261
- 2003
- 2003
- English.
-
In: Proceedings. International Parallel and Distributed Processing Symposium, 2003. - 1530-2075. - 0769519261
- Related links:
-
http://dx.doi.org/10...
-
show more...
-
https://doi.org/10.1...
-
https://research.cha...
-
show less...
Abstract
Subject headings
Close
- This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. A previously proposed priority-driven scheduling algorithm for periodic tasks with migration capability is extended to aperiodic scheduling and is shown to have a capacity bound of 0.5. This bound is close to the best achievable for a priority-driven scheduling algorithm. With an infinite number of processors, no priority-driven scheduling algorithm can perform better. We also propose a simple admission controller which guarantees that admitted tasks meet their deadlines and for many workloads, it admits tasks so that the utilization can be kept above the capacity bound.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datorteknik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Engineering (hsv//eng)
Publication and Content Type
- kon (subject category)
- ref (subject category)
Find in a library
To the university's database