DocumentCode
1553961
Title
Multiprocessor online scheduling of hard-real-time tasks
Author
Dertouzos, Michael L. ; Mok, Aloysius Ka-lau
Author_Institution
Lab. for Comput. Sci., MIT, Cambridge, MA, USA
Volume
15
Issue
12
fYear
1989
fDate
12/1/1989 12:00:00 AM
Firstpage
1497
Lastpage
1506
Abstract
The problems of hard-real-time task scheduling in a multiprocessor environment are discussed in terms of a scheduling game representation of the problem. It is shown that optimal scheduling without a priori knowledge is impossible in the multiprocessor case even if there is no restriction on preemption owing to precedence or mutual exclusion constraints. Sufficient conditions that permit a set of tasks to be optimally scheduled at run time are derived
Keywords
multiprocessing systems; multiprogramming; real-time systems; scheduling; a priori knowledge; hard-real-time task scheduling; multiprocessor environment; mutual exclusion constraints; optimal scheduling; scheduling game representation; Computer science; Helium; Microprocessors; Multiprocessing systems; Optimal scheduling; Processor scheduling; Robot control; Runtime; Sufficient conditions; Time factors;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/32.58762
Filename
58762
Link To Document