Compositional performance analysis with improved analysis techniques for obtaining viable end-to-end latencies in distributed embedded systems

Rox, Jonas; Ernst, Rolf

doi:10.1007/s10009-012-0260-z

Cited by 13 publications

(11 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later, Xia, Jin, and Zeng (2016), Xia et al (2017a), andGutiérrez-Gaitán andYomsi (2018) introduced the supply/demand-bound analysis into the discussion. Xia, Jin, and Zeng (2016) proposed the use of the DBF concept (Baruah, Rosier, and Howell 1990) to determine the schedulability of network flows by means of a resource-based approach, borrowing the ideas from the compositional performance analysis of Rox and Ernst (2013), the resource-aware task approach for multiprocessor scheduling from Tillenius et al (2015), and the derivation of the demandbound functions for mixed-criticality sporadic tasks (Ekberg and Yi 2012). This last work is used by Xia et al (2017a) when exploring the resource-based analysis into the mixedcriticality domain.…”

Section: Rta Dba and Uba In Wirelesshart-like Networkmentioning

confidence: 99%

See 1 more Smart Citation

Multiprocessor Scheduling meets the Industrial Wireless

Gaitán

Yomsi²

2019

UPjeng

View full text Add to dashboard Cite

This survey covers the schedulability analysis approaches that have recently been proposed for multi-hop and multi-channel wireless sensor and actuator networks in the industrial control process domain. It reviews the noticeable results with a focus on IEC 62591 (WirelessHART) and ANSI/ISA100.11a-2011 (ISA100.11a), the two major wireless standards in the process automation industry. The paper addresses the mapping of multi-channel transmission scheduling to multiprocessor scheduling theory, and recognizes this mapping as a key research direction. It also provides a taxonomy of the existing approaches and discusses the main features and recent evolutions. The survey identifies a number of open issues, key research challenges, and promising future directions.

show abstract

Section: Rta Dba and Uba In Wirelesshart-like Networkmentioning

confidence: 99%

“…Supply/demand bound analysis under mixed-criticality (Xia et al 2017a) EDF DBF (Baruah, Rosier, and Howell 1990), (Rox and Ernst 2013), (Tillenius et al 2015), (Ekberg and Yi 2012), (Mok, Feng, and Chen 2001), (Shin and Lee 2003).…”

Section: Simulationsmentioning

confidence: 99%

Multiprocessor Scheduling meets the Industrial Wireless

Gaitán

Yomsi²

2019

UPjeng

View full text Add to dashboard Cite

show abstract

“…rbf i is a staircase function, and it is essentially the same as the upper arrival curve in Real-Time Calculus [5] and SymTA/S [12]. As a common assumption in EDF scheduling analysis [2], [14], there exists a bounded number L such that…”

Section: B Workload Modelmentioning

confidence: 99%

“…RTA is not only useful to perform local schedulability test on single-processors, but also plays important roles in the analysis of more complex real-time systems, e.g., distributed systems where the completion of a task generates outputs triggering computation or communication tasks on subsequent infrastructures [15], [6], [11], [12]. Since the completion time of the preceding task decides the release times of subsequent tasks, one can use RTA to bound the completion time of each task and decide the "release jitter" of the subsequent tasks.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

General and efficient Response Time Analysis for EDF scheduling

Guan¹,

Wang²

2014

Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE), 2014

View full text Add to dashboard Cite

Response Time Analysis (RTA) is one of the key problems in real-time system design. This paper proposes new RTA methods for EDF scheduling, with general system models where workload and resource availability are represented by request/demand bound functions and supply bound functions. The main idea is to derive response time upper bounds by lower-bounding the slack times. We first present a simple overapproximate RTA method, which lower bounds the slack time by measuring the "horizontal distance" between the demand bound function and the supply bound function. Then we present an exact RTA method based on the above idea but eliminating the pessimism in the first analysis. This new exact RTA method, not only allows to precisely analyze more general system models than existing EDF RTA techniques, but also significantly improves analysis efficiency. Experiments are conducted to show efficiency improvement of our new RTA technique, and tradeoffs between the analysis precision and efficiency of the two methods in this paper are discussed.978-3-9815370-2-4/DATE14/ c 2014 EDAA

show abstract

Techniques for Building Timing-Predictable Embedded Systems

Guan

2016

View full text Add to dashboard Cite

Compositional performance analysis with improved analysis techniques for obtaining viable end-to-end latencies in distributed embedded systems

Cited by 13 publications

References 33 publications

Multiprocessor Scheduling meets the Industrial Wireless

Multiprocessor Scheduling meets the Industrial Wireless

General and efficient Response Time Analysis for EDF scheduling

Techniques for Building Timing-Predictable Embedded Systems

Contact Info

Product

Resources

About