2006 · 271 citations · 13 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureReal-time SystemsSchedulingEarliest Deadline First SchedulingPreemptive SchedulingReal-time SchedulingSchedulability AnalysisSoft Real-time SystemsTask SchedulingMultiprocessor Earliest Deadline First SchedulingMultiprocessor Real-time SchedulingMultiprocessor SchedulabilityMultiprocessor SchedulingNonpreemptive SchedulingReal-time ConstraintsScheduling AlgorithmsSoft Real-time Scheduling
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
13
Proportionate progress: A notion of fairness in resource allocation
Sanjoy Baruah, Nathann Cohen, C. Gregory Plaxton et al. · Algorithmica · 1996 · 707 citations
Multiprocessor EDF and deadline monotonic schedulability analysis
T. P. Baker · 2004 · 269 citations
The Spring kernel: a new paradigm for real-time systems
John A. Stankovic, Krithi Ramamritham · IEEE Software · 1991 · 262 citations