Based on loosely coupled services in an XML engine, we describe how to realize fine-grained lock protocols, which can guarantee transaction isolation for applications using differ...
Abstract. This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of s...
Anthony Discolo, Tim Harris, Simon Marlow, Simon L...
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
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-...
James H. Anderson, Srikanth Ramamurthy, Mark Moir,...