Summary: Is Semi-Partitioned Scheduling Practical?
Andrea Bastoni, Bjšorn B. Brandenburg, and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Semi-partitioned schedulers are--in theory--a particularly
promising category of multiprocessor real-time scheduling al-
gorithms. Unfortunately, issues pertaining to their implemen-
tation 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 schedula-
bility 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.
The advent of multicore technologies has led to a surge of new
research on multiprocessor real-time scheduling algorithms.
When devising such algorithms and associated analysis, the