Bounding the Number of Self-Blocking Occurrences of SIRAP

Behnam, Moris; Nolte, Thomas; Bril, Reinder J.

doi:10.1109/rtss.2010.20

Cited by 10 publications

(8 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The SIRAP, proposed by Behnam et al [10], uses self-blocking for hard real-time tasks in HSFs on a single processor and its associated analysis supports composition. Behnam et al [13] have been significantly improved their original SIRAP analysis [10] by bounding the number of spin locks within a time interval relative to the number of overlapping reservation periods. We will show, however, that the strength of SIRAP's analysis comes from its detailed system model, making it difficult to analyze components where these timing characteristics are unavailable.…”

Section: A the Synchronization Mechanisms We Compare In This Papermentioning

confidence: 99%

“…With SIRAP [10,13] a task is only allowed to start the execution of a critical section when it has sufficient budget to complete it. If a task wishes to start a critical section and the remaining budget is insufficient, then the task spin locks, i.e., it idles away processor time and it disables preemptions of other local tasks, until the corresponding component's budget is replenished.…”

Section: A Task-level Self Blockingmentioning

confidence: 99%

“…For the purpose of improving the analysis of the ibf Γ s ptq, the SIRAP analysis [13] requires additional knowledge about the number of critical sections of each task. This knowledge, together with the WCETs of the critical sections, allows us to tighten the estimated self-blocking durations that the tasks of a component may spend on spin locking in a time interval of length t. The (cumulative) self-blocking term ibf Γ s ptq of a component C s is then defined in terms of the critical-sections' WCETs, h si , captured in a multi-set G s ptq, i.e., …”

Section: ) Spin Locks or Budget Overruns: What's The Difference?mentioning

confidence: 99%

“…For ONP[12] and SIRAP[13] the term O s ptq is defined by: max p0,X s ¡Q s q for SIRAP.A component arbitrated by OWP can only request an extra amount of X s time units of the processor once. Hence, O s ptq becomes time independent and it is again defined as in…”

mentioning

confidence: 99%

See 3 more Smart Citations

Performance evaluation of analysis methods for arbitrating non-preemptive resource access in compositional real-time systems

Heuvel

Bril

Lukkien

et al. 2014

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

Self Cite

View full text Add to dashboard Cite

In this paper, we compare and survey different ways to model the scheduling delays corresponding to nonpreemptive critical sections being executed by the tasks of different components that ultimately need to share one processor. We focus on the performance of compositional timing analyses for systems and we compare different protocols for the arbitration of tasks that wish to execute critical sections. Such analysis methods support timing predictable composition of independently validated components. This validation consists of analyzing the worst-case impact of critical sections on the schedules of the component's tasks. Finally, we evaluate the performance of the analysis methods by means of a simulation study.

show abstract

Section: A the Synchronization Mechanisms We Compare In This Papermentioning

confidence: 99%

Section: A Task-level Self Blockingmentioning

confidence: 99%

Section: ) Spin Locks or Budget Overruns: What's The Difference?mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Performance evaluation of analysis methods for arbitrating non-preemptive resource access in compositional real-time systems

Heuvel

Bril

Lukkien

et al. 2014

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

Self Cite

View full text Add to dashboard Cite

show abstract

“…In (7) the activation of all higher priority messages that can contribute to this equation can be extracted by knowing the current time t. We define a multi-set G i (t) [20] that contains the upper bound number of switching delays from each message that contribute in Shared Link Delay at time t. This upper bound is equal to the maximum number of possible activation of messages within time interval [0,t]. Depending on the time t, a number of elements will be taken from G i (t) and to consider the worst-case scenario, the selected elements should be the highest ones.…”

Section: B Improved Response Time Analysismentioning

confidence: 99%

Performance analysis of master-slave multi-hop switched ethernet networks

Ashjaei

Behnam

Nolte

et al. 2013

2013 8th IEEE International Symposium on Industrial Embedded Systems (SIES)

Self Cite

View full text Add to dashboard Cite

There is an increasing trend towards using switched Ethernet in real-time distributed systems due to features like absence of collisions and high throughput. Nevertheless, a few problems persist, in particular related to priority inversion and limited length in queues. In this paper we focus on a protocol which uses a master-slave technique over standard switched Ethernet in order to overcome such problems, namely the FTT-SE protocol. We present an improved response time analysis for such a network and we compare, analytically and with simulations, the results achieved with Network Calculus on a worst-case scenario. We show that our proposed response time analysis gives tighter bounds compared to Network Calculus. Moreover, we compare the performance of different solutions to scale the FTT-SE protocol with respect to the bandwidth utilization. Finally, we propose a new architecture to improve the average performance of master-slave switched Ethernet networks.

show abstract

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

et al. 2017

Self Cite

View full text Add to dashboard Cite

Commercial off-the-shelf programmable platforms for real-time systems typically contain a cache to bridge the gap between the processor speed and main memory speed. Because cache-related pre-emption delays (CRPD) can have a significant influence on the computation times of tasks, CRPD have been integrated in the response time analysis for fixed-priority pre-emptive scheduling (FPPS). This paper presents CRPD aware response-time analysis of sporadic tasks with arbitrary deadlines for fixed-priority pre-emption threshold scheduling (FPTS), generalizing earlier work. The analysis is complemented by an optimal (pre-emption) threshold assignment algorithm, assuming the priorities of tasks are given. We further improve upon these results by presenting an algorithm that searches for a layout of tasks in memory that makes a task set schedulable. The paper includes an extensive comparative evaluation of the schedulability ratios of FPPS and FPTS, taking CRPD into account. The practical relevance of our work stems from FPTS support in AUTOSAR, a standardized development model for the automotive industry. Keywords Fixed-priority pre-emptive scheduling · Fixed-priority scheduling with pre-emption thresholds · Cache-related pre-emption delay · Response-time analysis B Reinder J. Bril

show abstract

Bounding the Number of Self-Blocking Occurrences of SIRAP

Abstract: Abstract

Cited by 10 publications

References 18 publications

Performance evaluation of analysis methods for arbitrating non-preemptive resource access in compositional real-time systems

Performance evaluation of analysis methods for arbitrating non-preemptive resource access in compositional real-time systems

Performance analysis of master-slave multi-hop switched ethernet networks

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

Contact Info

Product

Resources

About