Aaron Block, The University of North Carolina at Chapel Hill, USA
We present a real-time, Linux-based testbed called LITMUS^RT, which we have developed for empirically evaluating multiprocessor real-time scheduling algorithms. We also present the results from such an evaluation, in which partitioned earliest-deadline-first (EDF) scheduling, preemptive and nonpreemptive global EDF scheduling, and two variants of the global PD^2 Pfair algorithm were considered. The tested algorithms were compared based on both raw performance and schedulability (with real overheads considered) 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 approaches using empirical data.
Citation:
John M. Calandrino, Hennadiy Leontyev, Aaron Block, UmaMaheswari C. Devi, James H. Anderson, "LITMUS^RT : A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers," rtss, pp.111-126, 27th IEEE International Real-Time Systems Symposium (RTSS'06), 2006