Paper Info
Title
Allowance-Fit: a partitioning algorithm for temporal robustness of hard real-time systems upon multiprocessors
Abstract
We consider in this paper a partitioned real-time multiprocessor scheduling problem for sporadic task having constrained deadlines and a fixed priority scheduling. A major problem with partitioned scheduling is to determine if there exists a valid partitioning satisfying all the tasks deadlines. Many algorithms have tried to solve this problem. Most of them have considered First Fit Partitioning to minimize the number of processors required at the price of maximizing the load on each assigned processors. In this paper, we propose another partitioning strategy that aims at maximizing the allowance of WCETs of the tasks defined as the maximum extra duration that can be given to a task without compromising the task deadlines. The Allowance-Fit partitioning we propose uses the allowance criteria. We show that the partition found by our algorithm improves the temporal robustness of all the tasks of the system in the case of WCET overruns faults.
Year
Venue
Keywords
2009
ETFA
fixed priority scheduling,partitioning strategy,task deadline,tasks deadline,partitioning algorithm,sporadic task,valid partitioning,major problem,temporal robustness,partitioned real-time multiprocessor scheduling,hard real-time system,partitioned scheduling,allowance criterion,real time,multiprocessor scheduling,satisfiability
Field
DocType
ISSN
Fixed-priority pre-emptive scheduling,Multiprocessor scheduling,Fair-share scheduling,Computer science,Deadline-monotonic scheduling,Parallel computing,Algorithm,Real-time computing,Least slack time scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling
Conference
1946-0740
Citations 
PageRank 
References 
1
0.34
8
Authors
3
Name
Order
Citations
PageRank
Frédéric Fauberteau1383.58
Serge Midonnet27713.13
Laurent George321429.39