Sciweavers

186 search results - page 3 / 38
» Transactional Mutex Locks
Sort
View
SYRCODIS
2008
135views Database» more  SYRCODIS 2008»
13 years 7 months ago
Realizing Fine-Granular and Scalable Transaction Isolation in Native XML Databases
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...
Sebastian Bächle, Theo Härder
FLOPS
2006
Springer
13 years 10 months ago
Lock Free Data Structures Using STM in Haskell
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...
SPAA
2009
ACM
14 years 6 months ago
Scalable reader-writer locks
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...
Yossi Lev, Victor Luchangco, Marek Olszewski
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
13 years 4 months ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
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...
Francois Carouge, Michael F. Spear
RTDB
1996
82views more  RTDB 1996»
13 years 7 months ago
Lock-Free Transactions for Real-Time Systems
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,...