Title :
The feasibility analysis of multiprocessor real-time systems
Author :
Baruah, Sanjoy ; Fisher, Nathan
Author_Institution :
North Carolina Univ., Chapel Hill, NC
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;
Conference_Titel :
Real-Time Systems, 2006. 18th Euromicro Conference on
Conference_Location :
Dresden
Print_ISBN :
0-7695-2619-5
DOI :
10.1109/ECRTS.2006.29
