Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus

Chokshi, Devesh B.; Bhaduri, Purandar

doi:10.1109/rtcsa.2008.28

Cited by 13 publications

(12 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(7). The next message to be transmitted faces a situation that is similar to the single message case shown in Fig.…”

Section: B Multi Message Modelmentioning

confidence: 95%

“…Only then is m 4 transmitted. This blocking is a well-known phenomenon and forms the basis of, e.g., the FPNS analysis for RTC [7]. To the best of our knowledge, it has till now not been addressed in the context of ECA or other discrete-time approaches, however.…”

Section: B Timing Issues Of the Straightforward Fpns Implementationmentioning

confidence: 99%

“…has message to send AND r j = 0 ∀j > i no higher priority is waiting (7) With regard to the update function, after setting…”

Section: A-3mentioning

confidence: 99%

“…Efforts in this direction have been the analysis of correlated streams in [5] and lightweight state mechanics in [6]. A FPNS model has been proposed for RTC in [7], but it cannot directly interact with state-based subsystems.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Automata-theoretic modeling of fixed-priority non-preemptive scheduling for formal timing verification

Kauer¹,

Steinhorst²,

Schneider³

et al. 2014

2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)

View full text Add to dashboard Cite

The design process of safety-critical systems requires formal analysis methods to ensure their correct functionality without over-sized safety margins and extensive testing. For architectures with state-based events or scheduling, such as load-dependent frequency scaling, model checking has emerged as a promising tool. It formally verifies timing behavior of realtime systems with minimal over-approximation of the worst case delays. In this context, Event Count Automata (ECAs) have become a valuable modeling approach because they are specifically designed to handle typical arrival patterns and integrate well with analytic techniques.In this work, we propose an extension of the ECA framework's semantics and use it in a Fixed-Priority Non-preemptive Scheduling (FPNS) model that correctly abstracts the intra-slot behavior in the slotted-time model of the ECA. This is challenging because straightforward implementations cannot capture the full behavior of event-triggered scheduling with such a time model that the ECA shares with most model checking based methods. In a case study, we obtain bounds via model checking a basic model and then our proposed model. We compare these bounds with a SystemC simulation. This shows that the bounds from the basic model are too optimistic -and exceeded in practicebecause it does not capture the full behavior, while the bounds from the proposed extended model are both safe and reasonably tight.

show abstract

“…(7). The next message to be transmitted faces a situation that is similar to the single message case shown in Fig.…”

Section: B Multi Message Modelmentioning

confidence: 95%

Section: B Timing Issues Of the Straightforward Fpns Implementationmentioning

confidence: 99%

“…has message to send AND r j = 0 ∀j > i no higher priority is waiting (7) With regard to the update function, after setting…”

Section: A-3mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Automata-theoretic modeling of fixed-priority non-preemptive scheduling for formal timing verification

Kauer¹,

Steinhorst²,

Schneider³

et al. 2014

2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)

View full text Add to dashboard Cite

show abstract

“…Resource based service curves can be calculated in a similar manner, thus, β uj (Δ) = β u × E min j and β l j (Δ) = β l × E max j[32].…”

mentioning

confidence: 99%

Rule-based peer-to-peer framework for decentralised real-time service oriented architectures

Cameron¹,

Stumptner²,

Nandagopal³

et al. 2015

Science of Computer Programming

View full text Add to dashboard Cite

Modularity has been a key issue in the design and development of modern embedded RealTime Software Systems (RTS) where modularity enables flexibility with respect to changes in platform, environment, and requirements, as well as reuse. In distributed RTS, similar ideas have led to the adoption of Commercial Off-The-Shelf (COTS) components integrated via Service-Oriented Architecture (SOA) principles and technologies that are already wellestablished in business-oriented information systems. However, current SOA technologies for orchestration, such as Enterprise Service Busses, do not meet strict time-dependent constraints on scalability and latency required by RTS. We present a novel approach to RTS development where the orchestration of real-time processes is decentralised among the services within a fully distributed rule-driven process framework. Our framework wraps around COTS components implementing individual processing steps in a decentralised real-time process. Our execution model incorporates real-time constraints and is configurable through message routing policies distributed as a knowledge base containing rule sets, and therefore dispenses with the need for a central orchestration component which could easily become a bottleneck. Deterministic behaviour can be achieved through the validation of the rule-sets and the use of Modular Performance Analysis (MPA). We analyse the performance of our architecture using the Real-Time Calculus and show by empirical evaluation that our method scales to a typical real-time process application found in a tactical naval combat system context.

show abstract

References

2018

Deterministic Network Calculus

View full text Add to dashboard Cite

Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus

Cited by 13 publications

References 11 publications

Automata-theoretic modeling of fixed-priority non-preemptive scheduling for formal timing verification

Automata-theoretic modeling of fixed-priority non-preemptive scheduling for formal timing verification

Rule-based peer-to-peer framework for decentralised real-time service oriented architectures

References

Contact Info

Product

Resources

About