: A Testbed for Empirically Comparing Real-Time
John M. Calandrino, Hennadiy Leontyev, Aaron Block, UmaMaheswari C. Devi, and James H. Anderson
Department of Computer Science, The University of North Carolina at Chapel Hill
We present a real-time, Linux-based testbed called
, which we have developed for empirically eval-
uating multiprocessor real-time scheduling algorithms. We
also present the results from such an evaluation, in which
partitioned earliest-deadline-first (EDF) scheduling, pre-
emptive and nonpreemptive global EDF scheduling, and two
variants of the global PD2
Pfair algorithm were considered.
The tested algorithms were compared based on both raw
performance and schedulability (with real overheads con-
sidered) assuming either hard- or soft-real-time constraints.
To our knowledge, this paper is the first attempt by anyone
to compare partitioned and global real-time scheduling ap-