DocumentCode
2157223
Title
The feasibility analysis of multiprocessor real-time systems
Author
Baruah, Sanjoy ; Fisher, Nathan
Author_Institution
North Carolina Univ., Chapel Hill, NC
fYear
0
fDate
0-0 0
Lastpage
96
Abstract
The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for determining whether a given collection of jobs can be scheduled to meet all deadlines upon a specified multiprocessor platform - these tests may be applied even when the collection of jobs is incompletely specified. The applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks is discussed
Keywords
multiprocessing systems; processor scheduling; real-time systems; feasibility analysis; multiprocessor real-time systems; multiprocessor scheduling; Algorithm design and analysis; Costs; Performance analysis; Polynomials; Processor scheduling; Real time systems; Resumes; Runtime; Sufficient conditions; System testing; Feasibility analysis; Multiprocessor platforms; Recurrent tasks.; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Systems, 2006. 18th Euromicro Conference on
Conference_Location
Dresden
ISSN
1068-3070
Print_ISBN
0-7695-2619-5
Type
conf
DOI
10.1109/ECRTS.2006.29
Filename
1647728
Link To Document