Skip to search formSkip to main contentSkip to account menu

Stack Resource Policy

Known as: SRP 
The Stack Resource Policy (SRP) is not the same as the Priority ceiling protocol which is for fixed priority tasks (FP). SRP was defined by T. P… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Earliest deadline first schedulingPriority ceiling protocol

Broader (1)

Real-time computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Hardware-in-the-loop based WCET analysis with KLEE
C programming dominates the mainstream of embedded development as of today. To aid the development, hardware abstractions… 
2011
2011
The Iterated Prisoner's Dilemma on a Cycle
Pavlov, a well-known strategy in game theory, has been shown to have some advantages in the Iterated Prisoner's Dilemma (IPD… 
2011
2011
Programming embedded real-time systems : implementation techniques for concurrent reactive objects
An embedded system is a computer system that is a part of a larger device with hardware and mechanical parts. Such a system often… 
2010
2010
Protocol-transparent resource sharing in hierarchically scheduled real-time systems
Hierarchical scheduling frameworks (HSFs) provide means for composing complex real-time systems from well-defined, independently… 
2009
2009
Schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks revisited
In this paper, we show that both global as well as local schedulability analysis of synchronization protocols based on the stack… 
2008
2008
Hybrid-priority real-time scheduling
A hybrid scheduling algorithm is proposed, which integrates features of the fixed priority (FP) and earliest deadline first (EDF… 
2003
2003
An efficient job selection scheme in real-time scheduling under the stack resource policy
The stack resource policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is… 
2002
2002
Application-defined scheduling in Ada
This paper presents an application program interface (API) that enables Ada applications to use application-defined scheduling… 
1999
1999
Sharing resources among periodic and aperiodic tasks with dynamic deadlines
In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that… 
1998
1998
Dynamic transaction scheduling and reallocation in overloaded real-time database systems
We introduce a novel scheduling architecture with a new algorithm for dynamically resolving transient overloads, that is executed… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)