Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

27th IEEE International Real-Time Systems Symposium (RTSS'06)   pp. 257-270
Resource Sharing in Hierarchical Fixed Priority Pre-Emptive Systems

Full Article Text: Download PDF of full textBuy this article

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTSS.2006.42
Send link to a friend

Abstract
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.
Additional Information

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

Similar Articles

Abstract Contents
Abstract
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback