loading...
Resource Sharing in Hierarchical Fixed Priority Pre-Emptive Systems
Rio de Janeiro, Brazil December 05-December 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTSS.2006.4227th IEEE International Real-Time Sys ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
R.I. Davis, University of York, UK
A. Burns, University of York, UK
This paper focuses on resource sharing in hierarchical fixed priority pre-emptive systems where a number of separate applications, each with its own server, reside on a single processor. It defines the Hierarchical Stack Resource Policy, an appropriate global resource access policy that bounds priority inversion and also limits interference due to overruns during resource access.

The paper provides detailed response time analysis enabling the schedulability of application servers and tasks to be determined for systems with local and global resource access. This analysis is applicable to real-world systems where server-based applications need mutually exclusive access to shared resources such as communications buffers, peripheral devices, operating system calls and data structures shared with interrupt handlers.

Citation:
R.I. Davis, A. Burns, "Resource Sharing in Hierarchical Fixed Priority Pre-Emptive Systems," rtss, pp.257-270, 27th IEEE International Real-Time Systems Symposium (RTSS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.