Robust partitioning for real-time multiprocessor systems with shared resources

Authors:
Frédéric Fauberteau;Serge Midonnet
Affiliations:
Université Paris-Est, Marne-la-Vallée Cedex, France;Université Paris-Est, Marne-la-Vallée Cedex, France
Venue:
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
Year:
2011

Citing 12
Cited 0

Stack-based scheduling for realtime processes

Real-Time Systems
Allocating hard real-time tasks: an NP-hard problem made easy

Real-Time Systems
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
A comparison of MPCP and MSRP when sharing resources in the Janus multiple-processor on a chip platform

RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Applicability of simulated annealing methods to real-time scheduling and jitter control

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Biasing Effects in Schedulability Measures

ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Dealing with execution-overruns to improve the temporal robustness of real-time systems scheduled FP and EDF

ICONS '07 Proceedings of the Second International Conference on Systems
A Flexible Real-Time Locking Protocol for Multiprocessors

RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
An Implementation of the PCP, SRP, D-PCP, M-PCP, and FMLP Real-Time Synchronization Protocols in LITMUS^RT

RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Extending a Task Allocation Algorithm for Graceful Degradation of Real-Time Distributed Embedded Systems

RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
A novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems

Parallel Computing
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

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.