A stack-based resource allocation policy for realtime processes

Baker, Theodore P.

doi:10.1109/real.1990.128747

Cited by 215 publications

(141 citation statements)

References 10 publications

Supporting

Mentioning

137

Contrasting

Unclassified

Order By: Relevance

“…Similar to the stack resource policy [5], edf+rdp guarantees that all jobs can share a common run-time stack without conflicts. This can simplify implementations and substantially reduce memory requirements.…”

Section: Lemma 44 (No Preemption By Older Jobs)mentioning

confidence: 99%

See 1 more Smart Citation

An optimal resource sharing protocol for generalized multiframe tasks

Ekberg

Guan

Stigge

et al. 2015

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

Many different task models of varying expressiveness have been proposed to capture the timing constraints of real-time workloads. However, techniques for optimal scheduling and exact feasibility analysis of systems with mutuallyexclusive shared resources have been available only for relatively simple task models, such as the sporadic task model. We consider sharing of mutuallyexclusive resources in task models that are more expressive in terms of the jobrelease patterns that can be modeled. We propose a new scheduling algorithm and show that it is optimal for scheduling generalized multiframe tasks with shared resources on uniprocessor systems. We also present an efficient feasibility test for such systems, and show that it is both sufficient and necessary.

show abstract

Section: Lemma 44 (No Preemption By Older Jobs)mentioning

confidence: 99%

“…Baker proposed the stack resource policy (srp) [5], which works well with dynamic-priority scheduling algorithms. An interesting property of srp is that it allows all jobs to share a common run-time stack without conflicts, a property which is shared with the algorithm proposed in this paper.…”

Section: Related Workmentioning

confidence: 99%

An optimal resource sharing protocol for generalized multiframe tasks

Ekberg

Guan

Stigge

et al. 2015

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

show abstract

“…The task and resource model undertaken for this presentation follows that of the Stack Resource Policy (SRP) [7]. For this presentation we use task instance and task interchangeably.…”

Section: A Task and Resource Modelmentioning

confidence: 99%

“…(For the ARM-Cortex family of processors, the scheduling overhead is bound to a few clock cycles [8].) Given Worst Case Execution Time (WCET) for tasks (and their critical sections) we can deploy available SRP based methods for deriving per task response times [7].…”

Section: Monolithic Single-core Deploymentmentioning

confidence: 99%

Response time for IEC 61499 over Ethernet

Lindgren

Eriksson

Lindner

et al. 2015

2015 IEEE 13th International Conference on Industrial Informatics (INDIN)

View full text Add to dashboard Cite

Abstract-The IEC 61499 standard provides means to specify distributed control systems in terms of function blocks. The execution model is event driven (asynchronous), where triggering events may be associated with data (and seen as a message). In this paper we propose a low complexity implementation technique allowing to assess end-to-end response time of event chains spanning over a set of networked devices. In this paper we develop a method to provide safe end-to-end response time taking both intra-and inter-device delivery delays into account. As a use case we study the implementation onto (single-core) ARMcortex based devices communicating over a switched Ethernet network. For the analysis we define a generic switch model and an experimental setup allowing us to study the impact of network topology as well as 802.1Q quality of service in a mixed critical setting. Our results indicate that safe sub millisecond end-to-end response times can be obtained using the proposed approach.

show abstract

“…Since the underlying OS scheduler adopts RM scheduling, the priority P 1 of the rst server S 1 is higher than the priority P 2 of the second server S 2 . Figure 4 shows the executions of 1 Figure 4: RM and EDF server schedulers 0, all tasks arrives. 1 on server S 1 starts execution because it has a deadline earlier than that of 2 .…”

Section: Example 2 Edf Server Schedulermentioning

confidence: 99%

A fixed-priority-driven open environment for real-time applications

Kuo

Li²

Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054)

View full text Add to dashboard Cite

This paper extends the useful concept of open systems proposed by Liu, et al. 2, 3 in scheduling realtime applications and non-real-time applications, where the schedulability of each real-time application can be validated independently of other applications in the system. We replace the underlying earliest-deadline-rst OS scheduler of the open system architecture in 2, 3 with a rate-monotonic OS scheduler. The motivation behind this work is that many existing operating systems may not support the earliest deadline rst scheduling very well. We propose to use the idea of sporadic servers 14 to preserve CPU cycles for applications. We also develop schedulability tests for real-time applications which adopt the rate monotonic scheduling algorithm, the earliest deadline rst scheduling algorithm 11 , the priority ceiling protocol 18 , and the stack resource policy 1 . We allow tasks in each application to share local and global non-preemptable resources. A global resource synchronization mechanism is proposed. This paper provides a xed-priority-based alternative for the important open system architecture.

show abstract

A stack-based resource allocation policy for realtime processes

Cited by 215 publications

References 10 publications

An optimal resource sharing protocol for generalized multiframe tasks

An optimal resource sharing protocol for generalized multiframe tasks

Response time for IEC 61499 over Ethernet

A fixed-priority-driven open environment for real-time applications

Contact Info

Product

Resources

About