Sökning: onr:"swepub:oai:research.chalmers.se:1243267d-be3c-4f60-91a7-731666cd3858" >
Preemptive Multipro...
Preemptive Multiprocessor Scheduling Anomalies
-
- Andersson, Björn, 1974 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Jonsson, Jan, 1962 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
(creator_code:org_t)
- ISBN 0769515738
- 2002
- 2002
- Engelska.
-
Ingår i: Proceedings of the IEEE International Parallel and Distributed Processing Symposium, Ft Lauderdale, Florida, April 15–19, 2002. - 0769515738 ; , s. 12-19
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
https://doi.org/10.1...
-
https://research.cha...
-
visa färre...
Abstract
Ämnesord
Stäng
- Preemptive scheduling of periodically arriving tasks on a multiprocessor is considered. We show that many common multiprocessor real-time scheduling algorithms suffer from scheduling anomalies, that is, deadlines are originally met, but a decrease in execution times or an increase in periods of tasks can cause deadlines to be missed. We propose a partitioned multiprocessor fixed-priority scheduling algorithm with the prominent features that (i) it does not suffer from such scheduling anomalies and (ii) if less than 41% of the capacity is used then deadlines are met.
Ä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)
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas