2010 · 36 citations · 9 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureReal-time SystemsSchedulingDeadline AnalysisReal-time SchedulingReal-time Systems DesignResource-constrained SchedulingSchedulability AnalysisSoft Real-time SystemsDag SchedulingDirected Acyclic Graph SchedulingGraph ProcessingMultiprocessor Real-time SchedulingReal-time Scheduling AnalysisReal-time Task SchedulingScheduling AlgorithmsSoft Real-time Scheduling
In work on globally-scheduled real-time multiprocessor systems, analysis is lacking for supporting real-time applications developed using general processing graph models. In this paper, it is shown that bounded deadline tardiness can be ensured for such applications on a multiprocessor with no utilization loss. This result is general: it is applicable to periodic, sporadic, and rate-based directed-acyclic-graph (DAG) models and allows sophisticated notions of precedence to be supported (particularly, notions allowed by the processing graph method). This paper is the first to show that bounded tardiness can be ensured for globally-scheduled DAG-based applications without utilization loss.
9
Multiprocessor EDF and deadline monotonic schedulability analysis
T. P. Baker · 2004 · 269 citations
A theory of rate-based execution
Kevin Jeffay, Steve Goddard · 2003 · 92 citations