| | |
Summary: An Empirical Comparison of Global, Partitioned, and Clustered
Multiprocessor EDF Schedulers
Andrea Bastoni, Bjšorn B. Brandenburg, and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
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 pa-
per, such factors are investigated through an empirical com-
parison of global, partitioned, and clustered EDF schedul-
ing 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 approxi-
mated global approaches. For soft real-time systems, clus-
tered EDF scheduling algorithms proved to be particularly
effective. This study suggests that future global scheduling
research should focus on small-to-medium multicore plat-
forms rather than large platforms.
1 Introduction
In future multicore chip designs, per-chip core counts are
|
