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 approach, transactions are not susceptible to priority inversion or deadlock, do not require complicated mechanismsfor data-loggingor forrollingback aborted transactions, and are implemented as library routines that require no special kernel support.
James H. Anderson, Srikanth Ramamurthy, Mark Moir,