Stack-based scheduling of realtime processes

Baker, Theodore P.

doi:10.1007/bf00365393

Cited by 624 publications

(476 citation statements)

References 11 publications

Supporting

Mentioning

468

Contrasting

Unclassified

Order By: Relevance

“…tasks must preempt each other in a strict last-in first-out (LIFO) order. This is a requirement for stack-based scheduling, which is widely accepted for hard real-time systems [Baker 1991].…”

Section: Commentarymentioning

confidence: 99%

Explicit reservation of cache memory in a predictable, preemptive multitasking real-time system

Whitham

Audsley

Davis

2014

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

We describe and evaluate explicit reservation of cache memory to reduce the cache-related preemption delay (CRPD) observed when tasks share a cache in a preemptive multitasking hard real-time system. We demonstrate the approach using measurements obtained from a hardware prototype, and present schedulability analyses for systems that share a cache by explicit reservation. These analyses form the basis for a series of experiments to further evaluate the approach. We find that explicit reservation is most useful for larger task sets with high utilization. Some task sets cannot be scheduled with a conventional cache, but are schedulable with explicit reservation.

show abstract

Section: Commentarymentioning

confidence: 99%

Explicit reservation of cache memory in a predictable, preemptive multitasking real-time system

Whitham

Audsley

Davis

2014

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…However, the results can easily be extended to deal with multi-unit resources, as described in Ref. [2]. Now we state our terminology and notation used throughout the paper.…”

Section: Assumptions and Terminologymentioning

confidence: 99%

“…The most important are the Dynamic Priority Ceiling (DPC) protocol [5], the Stack Resource Policy (SRP) [2] and the Dynamic Deadline Modi®cation (DDM) protocol [10]. Although we base our discussion on SRP, which has been selected for its simplicity and generality, the feasibility analysis presented here is valid under any of these protocols.…”

Section: Accounting For Shared Resourcesmentioning

confidence: 99%

See 1 more Smart Citation

Schedulability analysis of periodic and aperiodic tasks with resource constraints

Lipari

Buttazzo

2000

Journal of Systems Architecture

View full text Add to dashboard Cite

In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that may share resources in exclusive mode in a dynamic environment, where tasks are scheduled based on their deadlines. Bounded blocking on exclusive resources is achieved by means of a dynamic resource access protocol which also prevents deadlocks and chained blocking. Aperiodic responsiveness is enhanced by an e cient servicing technique which assigns each aperiodic request a suitable deadline. Feasibility conditions are extended to handle tasks with deadlines di erent from periods and a reclaiming technique is presented to deal with early completions. Ó

show abstract

“…In preemptive systems a process can be removed from the CPU (Control Process Unit) due to the arriver of a higher priority process [1]. The objective, in the presented proposal, is to maximize the use of the network resources while the number of connections that would have access to the network denied is minimized.…”

Section: Preemptionmentioning

confidence: 99%

A proposal and evaluation of a LSP preemption policy implemented with fuzzy logic and genetic algorithms in a diffserv/MPLS test-bed

Vieira

Guardieiro

Proceedings. 2005 International Conference on Communications, Circuits and Systems, 2005.

View full text Add to dashboard Cite

-The increasing use of multimedia and real time applications in the Internet requires solutions based on resource reservation to provide quality of service. However, the ineffective use of the resources damage such solutions. Thus, the establishment of traffic engineering strategies integrated with proposals of quality of service becomes necessary, aiming to solve this problem. A proposal of solution to such problem uses the preemption to prevent idle resources in the domain searching to take care of other traffics of bigger priority. In this paper, it is proposed and evaluated a LSP preemption politics implemented with fuzzy controller. The validity of the proposal is demonstrated from results obtained in an experimental study.

show abstract

Stack-based scheduling of realtime processes

Cited by 624 publications

References 11 publications

Explicit reservation of cache memory in a predictable, preemptive multitasking real-time system

Explicit reservation of cache memory in a predictable, preemptive multitasking real-time system

Schedulability analysis of periodic and aperiodic tasks with resource constraints

A proposal and evaluation of a LSP preemption policy implemented with fuzzy logic and genetic algorithms in a diffserv/MPLS test-bed

Contact Info

Product

Resources

About