Timing analysis of mixed-criticality hard real-time applications implemented on distributed partitioned architectures

Marinescu, Sorin Ovidiu; Tămaş-Selicean, Domiţian; Acretoaie, Vlad; Pop, Paul

doi:10.1109/etfa.2012.6489720

Cited by 5 publications

(4 citation statements)

References 10 publications

(24 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Despite the improvements of this approach, it has only been proposed for linear flows in hierarchically scheduled time partitioned systems [12], which limits its applicability to complex multipath system models like the industrial use-case addressed in this paper. Another interesting contribution on the schedulability analysis of time-partitioned systems was proposed in [13], where a response time analysis method is proposed for mixed criticallity applications. This technique is not applicable to our work since it does not allow tasks of the same flow to be located in different partitions, which is a common feature in partitioned systems that make use of an Input/Output (I/O) partition to handle communications with other nodes of a distributed architecture.…”

Section: A Related Workmentioning

confidence: 99%

Response-Time Analysis of Multipath Flows in Hierarchically-Scheduled Time-Partitioned Distributed Real-Time Systems

et al. 2020

View full text Add to dashboard Cite

Modern industrial cyberphisical systems exhibit increasingly complex execution patterns like multipath endto-end flows, that force the real-time community to extend the schedulability analysis methods to include these patterns. Only then it is possible to ensure that applications meet their deadlines even in the worstcase scenario. As a driving motivation, we present a real industrial application with safety requirements, that needs to be re-factored in order to leverage the features of new execution paradigms such as time partitioning. In this context we develop a new response-time analysis technique that provides the capacity of obtaining the worst-case response time of multipath flows in time-partitioned hierarchical schedulers and also in general fixed-priority (FP) real-time systems. We show that the results obtained with the new analysis reduce the pessimism of the currently used holistic analysis approach. INDEX TERMS Schedulability analysis, time partitioning, hierarchical scheduling, distributed systems, safety, industrial application.

show abstract

Section: A Related Workmentioning

confidence: 99%

Response-Time Analysis of Multipath Flows in Hierarchically-Scheduled Time-Partitioned Distributed Real-Time Systems

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The hypervisor controls access to the processor, the memory, and shared I/O devices. Yet another scheme is described by Marinescu et al [2012]. They are more concerned with partitioning as opposed to resource usage, and address distributed heterogeneous architectures.…”

Section: Hierarchical Schedulingmentioning

confidence: 99%

A Survey of Research into Mixed Criticality Systems

2017

View full text Add to dashboard Cite

This survey covers research into mixed criticality systems that has been published since Vestal's seminal paper in 2007, up until the end of 2016. The survey is organised along the lines of the major research areas within this topic. These include single processor analysis (including fixed priority and EDF scheduling, shared resources and static and synchronous scheduling), multiprocessor analysis, realistic models, and systems issues. The survey also explores the relationship between research into mixed criticality systems and other topics such as hard and soft time constraints, fault tolerant scheduling, hierarchical scheduling, cyber physical systems, probabilistic real-time systems, and industrial safety standards. CCS Concepts: •Computer systems organization → Real-time system specification; •Software and its engineering → Real-time schedulability; Real-time systems software;

show abstract

“…WCDOPS+ is extended in [10] for time partitioned systems and in [4] for graph-shaped transactions. The authors in [2] propose relative offsets and jitters to compute lower response time upper-bounds for tree-shaped transactions.…”

Section: Related Workmentioning

confidence: 99%

Extending schedulability tests of tree-shaped transactions for TDMA radio protocols

Singhoff²,

Rubini³

et al. 2014

Proceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA)

View full text Add to dashboard Cite

In this paper, a schedulability test is proposed for tree-shaped transactions with non-immediate tasks. A treeshaped transaction is a group of precedence dependent tasks, partitioned on different processors, which may release several other tasks upon completion. When there are non-immediate tasks, tasks are not necessarily released immediately upon their predecessor's completion. The schedulability test we propose is based on an existing test that does not handle non-immediate tasks directly. Simulation results show that tighter response time upper-bounds can be accessed when effects of non-immediateness are considered. Our schedulability test is motivated by real industrial TDMA systems developed at Thales, and experimental results show it provides less pessimistic schedulability results compared to current methods used by Thales system engineers.

show abstract

Timing analysis of mixed-criticality hard real-time applications implemented on distributed partitioned architectures

Cited by 5 publications

References 10 publications

Response-Time Analysis of Multipath Flows in Hierarchically-Scheduled Time-Partitioned Distributed Real-Time Systems

Response-Time Analysis of Multipath Flows in Hierarchically-Scheduled Time-Partitioned Distributed Real-Time Systems

A Survey of Research into Mixed Criticality Systems

Extending schedulability tests of tree-shaped transactions for TDMA radio protocols

Contact Info

Product

Resources

About