| | |
Summary: Lock-Free Transactions for Real-Time Systems
James H. Anderson, Srikanth Ramamurthy, Mark Moir, and Kevin Je ay
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-timesystems 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-
nismsfor data-loggingor forrollingback 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 con icting operations. If an operation of a
transaction creates acon ict, then one of two strategies
|
