A stack-based resource allocation policy for realtime processes
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 191-200
- https://doi.org/10.1109/real.1990.128747
Abstract
The stack resource policy (SRP) is a resource allocation policy which permits processes with different priorities to share a single runtime stack. It is a refinement of the priority ceiling protocol (PCP), which strictly bounds priority inversion and permits simple schedulability tests. With or without stack sharing, the SRP offers the following improvements over the PCP: (1) it unifies the treatment of stack, reader-writer, multiunit resources, and binary semaphores; (2) it applies directly to some dynamic scheduling policies, including earliest deadline first (EDF), as well as to static priority policies; (3) with EDF scheduling, it supports a stronger schedulability test; and (4) it reduces the maximum number of context switches for a job execution request by a factor of two. It is at least as good as the PCP in reducing maximum priority inversion.Keywords
This publication has 7 references indexed in Scilit:
- Toward the deterministic scheduling of Ada tasksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Real-time synchronization protocols for multiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989
- Implementing Priority Inheritance Algorithms in an Ada Runtime SystemPublished by Defense Technical Information Center (DTIC) ,1989
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Avoiding deadlock in multitasking systemsIBM Systems Journal, 1968