Robust Partitioned Scheduling for Real-Time Multiprocessor Systems

Fauberteau, Frédéric; Midonnet, Serge; George, Laurent

doi:10.1007/978-3-642-15234-4_19

Cited by 4 publications

(3 citation statements)

References 15 publications

(24 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Over the years, many results pertaining to the task and resource mapping problems as well as related optimization problems have appeared [13,34,70,76,87,88,99,100,101,111,112,115,134,149,152,154,168,180,189,195,198,208]. Particularly well-known is Lakshmanan et al's task-set partitioning heuristic for use with the MPCP [123].…”

Section: Further Research Directionsmentioning

confidence: 99%

Multiprocessor Real-Time Locking Protocols: A Systematic Review

Brandenburg

2019

Preprint

View full text Add to dashboard Cite

We systematically survey the literature on analytically sound multiprocessor real-time locking protocols from 1988 until 2018, covering the following topics:• progress mechanisms that prevent the lock-holder preemption problem (Section 3),• spin-lock protocols (Section 4),• binary semaphore protocols (Sections 5 and 6),• independence-preserving (or fully preemptive) locking protocols (Section 7),• reader-writer and k-exclusion synchronization (Section 8),• support for nested critical sections (Section 9), and • implementation and system-integration aspects (Section 10).A special focus is placed on the suspension-oblivious and suspension-aware analysis approaches for semaphore protocols, their respective notions of priority inversion, optimality criteria, lower bounds on maximum priority-inversion blocking, and matching asymptotically optimal locking protocols.

show abstract

Section: Further Research Directionsmentioning

confidence: 99%

Multiprocessor Real-Time Locking Protocols: A Systematic Review

Brandenburg

2019

Preprint

View full text Add to dashboard Cite

show abstract

“…Both approaches provide the optimal value of the allowance value but their complexities are too high to be used [3] online.…”

Section: Static Allowance For Robustnessmentioning

confidence: 99%

Slack-Time Computation for Temporal Robustness in Embedded Systems

Midonnet

Masson

Lassalle

2010

IEEE Embedded Syst. Lett.

Self Cite

View full text Add to dashboard Cite

Abstract-We propose to handle execution duration overruns (temporal faults) in real-time embedded systems. When a temporal fault occurs, the slack time can be dynamically determined and assigned to the faulty task in order to complete its treatment. This mechanism improves the temporal robustness of real-time systems. We demonstrate that an approximate slack stealer algorithm like the MASS algorithm is a good solution for real-time embedded systems. We validate the feasibility of this approach by an implementation on the Lego Mindstorm NXT platform.

show abstract

“…Alternatively, greater control over the system behavior can be obtained by using a "task guardian" [7], [23], [40]. The concept of allowance for handling task overrun is introduced in [41], [42].…”

Section: Introductionmentioning

confidence: 99%

Implementing Adaptive Time-Triggered Co-Operative Scheduling Framework for Highly-Predictable Embedded Systems

Nahas

Bautista-Quintero²

2014

AJESA

View full text Add to dashboard Cite

For many real-time embedded systems, Time-Triggered Cooperative (TTC) scheduling algorithms provide simple and reliable solution at low cost. Previous work in this area has focused on the development of a wide range of TTC implementations for various purposes (e.g. for achieving low-jitter characteristics, reducing CPU power consumption or dealing with task-overruns). Despite the great deal of work in this area, it can be said that each previous scheduler implementation was created to address only one particular problem in TTC algorithm. For applications which require extremely high degree of reliability, a combinational TTC architecture-that incorporates multiple features-can be an appropriate solution. This paper describes the implementation of an adaptive, highly-predictable TTC scheduler that addresses both jitter and task-overrun problems simultaneously. Furthermore, the presented scheduler incorporates an online technique for measuring the practical "worst-case execution time" for each task during system runtime. The behavior of the proposed scheduler is compared with a set of previously developed schedulers in terms of timing jitter, task-overrun handling capability and resource requirements for practical real-time implementations.

show abstract

Robust Partitioned Scheduling for Real-Time Multiprocessor Systems

Cited by 4 publications

References 15 publications

Multiprocessor Real-Time Locking Protocols: A Systematic Review

Multiprocessor Real-Time Locking Protocols: A Systematic Review

Slack-Time Computation for Temporal Robustness in Embedded Systems

Implementing Adaptive Time-Triggered Co-Operative Scheduling Framework for Highly-Predictable Embedded Systems

Contact Info

Product

Resources

About