DocumentCode
3204929
Title
Multiprocessor scheduling of periodic tasks in a hard real-time environment
Author
Khemka, Ashok ; Shyamasundar, R.K.
Author_Institution
Comput. Sci. Group, Tata Inst. of Fundamental Res., Bombay, India
fYear
1992
fDate
23-26 Mar 1992
Firstpage
76
Lastpage
81
Abstract
Preemptive scheduling a set of periodic tasks on multiprocessors is studied from the point of view of meeting their service requirements before given deadlines. Sufficient conditions permitting full utilization of the multiprocessor using the given scheduling algorithm are derived. Complexity of the scheduling algorithms including upper bounds on the number of preemptions are derived. Schemes (with little run-time cost) for on-line handling of tasks´ arrival and exit are given
Keywords
computational complexity; multiprocessing systems; parallel programming; scheduling; complexity; multiprocessors; preemptive scheduling; scheduling; Aerospace control; Command and control systems; Computer science; Costs; Processor scheduling; Real time systems; Runtime; Scheduling algorithm; Timing; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1992. Proceedings., Sixth International
Conference_Location
Beverly Hills, CA
Print_ISBN
0-8186-2672-0
Type
conf
DOI
10.1109/IPPS.1992.223068
Filename
223068
Link To Document