Sanjoy Baruah, Joël Goossens
Abstract
The global EDF scheduling of sporadic task systems upon uniform multiprocessor platforms is studied. A sufficient schedulability test is presented and proved correct. It is shown that this test generalizes the previously-known exact uniprocessor, and sufficient identical multiprocessor, EDF- schedulability tests.
OpenAlex reports 28 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.
The global EDF scheduling of sporadic task systems upon uniform multiprocessor platforms is studied. A sufficient schedulability test is presented and proved correct. It is shown that this test generalizes the previously-known exact uniprocessor, and sufficient identical multiprocessor, EDF- schedulability tests.
Key concepts: Uniprocessor system, Multiprocessing, Computer science, Parallel computing, Multiprocessor scheduling, Processor scheduling, Scheduling (production processes), Earliest deadline first scheduling