Is Semi-Partitioned Scheduling Practical?

Authors:
Andrea Bastoni;Bjorn B. Brandenburg;James H. Anderson
Affiliations:
-;-;-
Venue:
ECRTS '11 Proceedings of the 2011 23rd Euromicro Conference on Real-Time Systems
Year:
2011

Citing 0
Cited 6

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)
An experimental comparison of different real-time schedulers on multicore systems

Journal of Systems and Software
An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms

Journal of Experimental Algorithmics (JEA)
Harmonic semi-partitioned scheduling for fixed-priority real-time tasks on multi-core platform

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Semi-partitioned schedulers are -- in theory -- a particularly promising category of multiprocessor real-time scheduling algorithms. Unfortunately, issues pertaining to their implementation have not been investigated in detail, so their practical viability remains unclear. In this paper, the practical merit of three EDF-based semi-partitioned algorithms is assessed via an experimental comparison based on real-time schedulability under consideration of real, measured overheads. The presented results indicate that semi-partitioning is indeed a sound and practical idea. However, several problematic design choices are identified as well. These shortcomings and other implementation concerns are discussed in detail.