Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Wait-free Object-Sharing Schemes for Real-Time Uniprocessors and Multiprocessors
 

Summary: Wait-free Object-Sharing Schemes for Real-Time Uniprocessors and
Multiprocessors
James H. Anderson, Rohit Jain, and Srikanth Ramamurthy
Department of Computer Science, University of North Carolina, Chapel Hill, NC 27599-3175
Abstract
Several new wait-free object-sharing schemes for real-
time uniprocessors and multiprocessors are presented.
These schemes have characteristics in common with the
priority inheritance and priority ceiling protocols, but are
nonblocking and implemented at the user level. In total, six
new object-sharing schemes are proposed: two for unipro-
cessors and four for multiprocessors. Breakdown utilization
experiments are presented that show that the multiprocessor
schemes entail less overhead than lock-based schemes.
1. Introduction
In a wait-free object implementation [9], operations must
be implemented using bounded, sequential code fragments,
with no blocking synchronization constructs. In real-time
applications, wait-free object implementations are an at-
tractive alternative to more conventional lock-based object-

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences