LITMUS: A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers. We present a real-time, Linux-based testbed called LITMUS, 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 PD2 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.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Maggio, Martina; Lelli, Juri; Bini, Enrico: \textttrt-muse: measuring real-time characteristics of execution platforms (2017)
- Xu, Meng; Phan, Linh Thi Xuan; Sokolsky, Oleg; Xi, Sisu; Lu, Chenyang; Gill, Christopher; Lee, Insup: Cache-aware compositional analysis of real-time multicore virtualization platforms (2015)
- Sousa, Paulo Baltarejo; Bletsas, Konstantinos; Tovar, Eduardo; Souto, Pedro; Åkesson, Benny: Unified overhead-aware schedulability analysis for slot-based task-splitting (2014)
- Faggioli, Dario; Lipari, Giuseppe; Cucinotta, Tommaso: Analysis and implementation of the multiprocessor bandwidth inheritance protocol (2012)