Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
LockFree Transactions for RealTime Systems \Lambda James H. Anderson, Srikanth Ramamurthy, Mark Moir, and Kevin Jeffay
 

Summary: Lock­Free Transactions for Real­Time Systems \Lambda
James H. Anderson, Srikanth Ramamurthy, Mark Moir, and Kevin Jeffay
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
We show that previous algorithmic and scheduling
work concerning the use of lock­free objects in hard
real­time systems can be extended to support real­time
transactions on memory­resident data. Using our ap­
proach, transactions are not susceptible to priority in­
version or deadlock, do not require complicated mecha­
nisms for data­logging or for rolling back aborted trans­
actions, and are implemented as library routines that
require no special kernel support.
1 Introduction
In most real­time database systems, conventional
mechanisms such as locks, timestamps, and serializa­
tion graphs are used for concurrency control. The main
problem when using any of these mechanisms is that
of handling conflicting operations. If an operation of a
transaction creates a conflict, then one of two strategies

  

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

 

Collections: Computer Technologies and Information Sciences