Paper Info
Title
Robust partitioning for real-time multiprocessor systems with shared resources
Abstract
In this paper, we focus on the temporal robustness in the hard real-time multiprocessor systems. This robustness is the capacity to tolerate faults in such a way that no deadlines are missed. A model of sporadic and dependent tasks is considered. Our contribution is to propose a partitioning algorithm which assigns the tasks to processors in order to maximize the robustness of the system to Worst Case Execution Time (WCET) overruns faults or Minimum Inter-arrival Time (MIT) violations.
Year
DOI
Venue
2011
10.1145/2103380.2103394
RACS
Keywords
Field
DocType
minimum inter-arrival time,hard real-time multiprocessor system,overruns fault,worst case execution time,partitioning algorithm,temporal robustness,robust partitioning,shared resource,dependent task,robustness,real time
Worst-case execution time,Multiprocessor scheduling,Computer science,Parallel computing,Robustness (computer science),Real-time computing,Multiprocessing,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
12
Authors
2
Name
Order
Citations
PageRank
Frédéric Fauberteau1383.58
Serge Midonnet27713.13