DMCA
Real-Time Computing with Lock-Free Shared Objects (1997)
Cached
Download Links
| Venue: | ACM Transactions on Computer Systems |
| Citations: | 65 - 8 self |
BibTeX
@ARTICLE{Anderson97real-timecomputing,
author = {James Anderson and Srikanth Ramamurthy and Kevin Jeffay},
title = {Real-Time Computing with Lock-Free Shared Objects},
journal = {ACM Transactions on Computer Systems},
year = {1997},
volume = {15},
pages = {28--37}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior speci#c permission and#or a fee. Permissions may be requested from Publications Dept, ACM Inc., 1515 Broadway, New York, NY 10036 USA, fax +1 #212# 869-0481, or permissions@acm.org. Published in: ACM Transactions on Computing Systems, Volume 15, Number 2, May 1997, pages 134-165. 2 # J. Anderson, S. Ramamurthy, and K. Je#ay 1. INTRODUCTION Most work on implementing shared objects in preemptive hard real-time uniprocessor systems has focused on using critical sections to ensure object consistency. One of the main problems that arises when using critical sections is that of priority inversion. A priority inversion exists when a given task must wait on a task of lower priority to release a critical section. In a hard real-time system, unless priorityinversions are carefully controlled, it may be di#cult or imp...
