Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Real-Time Computing with Lock-Free Shared Objects James H. Anderson Srikanth Ramamurthy Kevin Je ay
 

Summary: Real-Time Computing with Lock-Free Shared Objects
James H. Anderson Srikanth Ramamurthy Kevin Je ay
Department of Computer Science, University of North Carolina, Chapel Hill, NC 27599-3175
Abstract
This paper considers the use of lock-free shared objects
within hard real-time systems. As the name suggests,
lock-free shared objects are distinguished by the fact
that they are not locked. As such, they do not give
rise to priority inversions, a key advantage over con-
ventional, lock-based object-sharing approaches. De-
spite this advantage, it is not immediately apparent
that lock-free shared objects can be employed if tasks
must adhere to strict timing constraints. In particular,
lock-free object implementations permit concurrent op-
erations to interfere with each other, and repeated in-
terferences can cause a given operation to take an ar-
bitrarily long time to complete.
The main contribution of this paper is to show that
such interferences can be bounded by judicious schedul-
ing. This work pertains to periodic, hard real-time

  

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

 

Collections: Computer Technologies and Information Sciences