Search: onr:"swepub:oai:research.chalmers.se:5ab5dc0b-3425-4434-a44d-581ed25dd3b2" >
Partitioned Aperiod...
Partitioned 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. We propose an algorithm for tasks without migration capabilities and prove that it has a capacity bound of 0.31. No algorithm for tasks without migration capabilities can have a capacity bound greater than 0.50.
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