Paper Info
Title
Execution Overrun Management for Fixed-Priority Preemptive Scheduling of Sporadic Graph Tasks
Abstract
In this paper, we consider a real-time application composed of graphs of subtasks. We present a mechanism for execution-overrun management in realtime systems. A subtask exceeding its prescribed execution duration can result in multiple failures (cascading effect). Yet, a task execution overrun does not necessarily lead to a deadline miss. Indeed, a system with enough free resources can self-stabilize without compromising the timeliness constraints of the subtasks in the system. We propose a mechanism based on the notion of allowance that enables to cope with execution overruns before a deadline miss. The task allowance depends on free resources. We show how to determine the maximum allowance duration a subtask can be allowed to proceed with it execution without compromising the real-time constraints of all the subtasks. We show how to determine the maximum allowance of a subtask from the feasibility conditions of sporadic graphs of subtasks scheduled with a preemptive fixed priority scheduling
Year
DOI
Venue
2006
10.1109/ETFA.2006.355375
Prague
Keywords
Field
DocType
fault tolerant computing,graph theory,execution overrun management,fixed priority scheduling,fixed-priority preemptive scheduling,real-time constraint,sporadic graph task,worst case response time,allowance,fault management,fault tolerance,feasibility analysis,fixed priority scheduling,precedence constraint real-time,worst case response time
Graph theory,Graph,Preemption,Worst case response time,Computer science,Real-time computing,Fault management,Fault tolerance,Priority scheduling,Distributed computing
Conference
ISSN
ISBN
Citations 
1946-0740
0-7803-9758-4
0
PageRank 
References 
Authors
0.34
11
4
Name
Order
Citations
PageRank
Lamine Bougueroua183.25
Hui Xue Zhao262.43
Laurent George321429.39
Serge Midonnet47713.13