Sciweavers

186 search results - page 19 / 38
» Transactional Mutex Locks
Sort
View
WOSP
2010
ACM
15 years 4 months ago
Analytical modeling of lock-based concurrency control with arbitrary transaction data access patterns
Nowadays the 2-Phase-Locking (2PL) concurrency control algorithm still plays a core rule in the construction of transactional systems (e.g. database systems and transactional memo...
Pierangelo di Sanzo, Roberto Palmieri, Bruno Cicia...
ADC
2004
Springer
141views Database» more  ADC 2004»
15 years 1 months ago
Conflict Scheduling of Transactions on XML Documents
In the last few years an interest in native XML databases has surfaced. With other authors we argue that such databases need their own provisions for concurrency control since tra...
Stijn Dekeyser, Jan Hidders
74
Voted
ICPP
2008
IEEE
15 years 4 months ago
Implementing and Exploiting Inevitability in Software Transactional Memory
—Transactional Memory (TM) takes responsibility for concurrent, atomic execution of labeled regions of code, freeing the programmer from the need to manage locks. Typical impleme...
Michael F. Spear, Michael Silverman, Luke Dalessan...
66
Voted
DEXAW
1997
IEEE
77views Database» more  DEXAW 1997»
15 years 1 months ago
A Per-object Based Hybrid Concurrency Control
Existing concurrency control algorithms do not well conform to various environments, in the performance perspective. Each algorithm has some assumption on the conflict characteris...
Tae-Young Kwak, Yoon-Joon Lee, Myoung-Ho Kim
DEXA
2009
Springer
127views Database» more  DEXA 2009»
15 years 4 months ago
The Real Performance Drivers behind XML Lock Protocols
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
Sebastian Bächle, Theo Härder