DocumentCode :
2830888
Title :
A stack-based resource allocation policy for realtime processes
Author :
Baker, T.P.
Author_Institution :
Dept. of Comput. Sci., Florida State Univ., Tallahassee, FL, USA
fYear :
1990
fDate :
5-7 Dec 1990
Firstpage :
191
Lastpage :
200
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 :
protocols; resource allocation; scheduling; binary semaphores; earliest deadline first; multiunit resources; priority ceiling protocol; priority inversion; realtime processes; schedulability tests; stack-based resource allocation policy; static priority policies; Computer science; Dynamic scheduling; Predictive models; Processor scheduling; Protocols; Resource management; Runtime; Switches; Testing; Timing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Real-Time Systems Symposium, 1990. Proceedings., 11th
Conference_Location :
Lake Buena Vista, FL
Print_ISBN :
0-8186-2112-5
Type :
conf
DOI :
10.1109/REAL.1990.128747
Filename :
128747
Link To Document :
بازگشت