Implementation of a Speedup-Optimal Global EDF Schedulability Test

Authors:
Sanjoy Baruah;Vincenzo Bonifaci;Alberto Marchetti-Spaccamela;Sebastian Stiller
Affiliations:
-;-;-;-
Venue:
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Year:
2009

Citing 0
Cited 12

Improved multiprocessor global schedulability analysis

Real-Time Systems
Provably good multiprocessor scheduling with resource sharing

Real-Time Systems
Open problems in real-time scheduling

Journal of Scheduling
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Real-Time Systems
Tests for global EDF schedulability analysis

Journal of Systems Architecture: the EUROMICRO Journal
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Zero-laxity based real-time multiprocessor scheduling

Journal of Systems and Software
Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

Real-Time Systems
FPSL, FPCL and FPZL schedulability analysis

Real-Time Systems
Buffer minimization in earliest-deadline first scheduling of dataflow graphs

Proceedings of the 14th ACM SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Implementation and evaluation of global and partitioned scheduling in a real-time OS

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent results have demonstrated the existence of a sufficient global EDF schedulability test for sporadic task systems that makes the following guarantee: any task system that is not determined to be schedulable on an m-processor platform by this test is guaranteed to actually not be so on a platform in which each processor is m/(2m-1) times as fast. A new global EDF schedulability test is proposed here that builds on this result. This new test is shown to be less pessimistic and more widely applicable than the earlier result was, while retaining the strong theoretical properties -- in particular, the speedup bound -- of the earlier result.