Evaluation of Existing Schedulability Tests for Global EDF

Authors:
Marko Bertogna
Affiliations:
-
Venue:
ICPPW '09 Proceedings of the 2009 International Conference on Parallel Processing Workshops
Year:
2009

Citing 0
Cited 6

Improved multiprocessor global schedulability analysis

Real-Time Systems
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Real-Time Systems
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)
FPSL, FPCL and FPZL schedulability analysis

Real-Time Systems
Mixed-criticality scheduling on multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The increasing attention on global scheduling algorithms for identical multiprocessor platforms produced different, independently developed, schedulability tests. However, the existing relations among such tests have not been sufficiently clarified, so that it is difficult to understand which strategy provides the best performances in a particular scenario. In this paper, we will summarize the main existing results for the schedulability analysis of multiprocessor systems scheduled with global \edf, showing, when possible, existing dominance relations. We will compare these algorithms taking into consideration different aspects, namely, run-time complexity, average performances over a randomly generated workload, sustainability properties and speedup factors.