An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers

Authors:
Andrea Bastoni;Bjorn B. Brandenburg;James H. Anderson
Affiliations:
-;-;-
Venue:
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Year:
2010

Citing 0
Cited 12

Swapping to reduce preemptions and migrations in EKG

ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
Real-time resource-sharing under clustered scheduling: mutex, reader-writer, and k-exclusion locks

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Partially non-preemptive dual priority multiprocessor scheduling

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Sharp utilization thresholds for some realtime scheduling problems

ACM SIGMETRICS Performance Evaluation Review
An experimental comparison of different real-time schedulers on multicore systems

Journal of Systems and Software
FPSL, FPCL and FPZL schedulability analysis

Real-Time Systems
A scheduling algorithm to reduce the static energy consumption of multiprocessor real-time systems

Proceedings of the 21st International conference on Real-Time Networks and Systems
An evaluation of the RUN algorithm in LITMUSRT

ACM SIGBED Review - Special Issue on the Work-in-Progress (WiP) session of the 33rd IEEE Real-Time Systems Symposium (RTSS'12)
Building timing predictable embedded systems

ACM Transactions on Embedded Computing Systems (TECS)
Implementation and evaluation of global and partitioned scheduling in a real-time OS

Real-Time Systems
Supporting soft real-time parallel applications on multiprocessors

Journal of Systems Architecture: the EUROMICRO Journal
Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

As multicore platforms become ever larger, overhead-related factors play a greater role in determining which real-time scheduling algorithms are preferable. In this paper, such factors are investigated through an empirical comparison of global, partitioned, and clustered EDF scheduling algorithms on a 24-core Intel system. On this platform, global EDF proved to be a non-viable choice for hard real time systems, while clusters of size six practically approximated global approaches. For soft real-time systems, clustered EDF scheduling algorithms proved to be particularly effective. This study suggests that future global scheduling research should focus on small-to-medium multicore platforms rather than large platforms.