Global EDF Schedulability Analysis of Arbitrary Sporadic Task Systems
Sanjoy Baruah, T. P. Baker
Abstract
Sanjoy Baruah, T. P. Baker
Abstract
Recent results on the global multiprocessor EDF scheduling of sporadic task systems are, for the most part, applicable only to task systems in which each taskpsilas relative deadline parameter is constrained to be no larger than its period. This paper introduces new analysis techniques that allow for similar results to be derived for task systems in which individual tasks are not constrained in this manner.
OpenAlex reports 32 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Recent results on the global multiprocessor EDF scheduling of sporadic task systems are, for the most part, applicable only to task systems in which each taskpsilas relative deadline parameter is constrained to be no larger than its period. This paper introduces new analysis techniques that allow for similar results to be derived for task systems in which individual tasks are not constrained in this manner.
Key concepts: Computer science, Multiprocessing, Processor scheduling, Scheduling (production processes), Task analysis, Distributed computing, Task (project management), Priority inversion