Sciweavers

202 search results - page 4 / 41
» Consensus on Transaction Commit
Sort
View
PPOPP
2009
ACM
14 years 10 months ago
Committing conflicting transactions in an STM
Dependence-aware transactional memory (DATM) is a recently proposed model for increasing concurrency of memory transactions without complicating their interface. DATM manages depe...
Hany E. Ramadan, Indrajit Roy, Maurice Herlihy, Em...
KRDB
2003
139views Database» more  KRDB 2003»
13 years 11 months ago
Expressing Transactions with Savepoints as Non-Markovian Theories of Actions
Flat transactions with savepoints are a variation of the classical flat transactions that allows the user to go undo work done so far back to a certain point within the transacti...
Iluju Kiringa, Alfredo Gabaldon
PCI
2001
Springer
14 years 2 months ago
Two-Phase Commit Processing with Restructured Commit Tree
Abstract. Extensive research has been carried out in search for an efcient atomic commit protocol and many optimizations have been suggested to improve the basic two-phase commit p...
George Samaras, George K. Kyrou, Panos K. Chrysant...
VLDB
1993
ACM
84views Database» more  VLDB 1993»
14 years 1 months ago
A New Presumed Commit Optimization for Two Phase Commit
Two phase commit (ZPC) ia used to coordinate the commitment of trunsactiom in distributed systems. The standard 2PC optimization is the presumed abort variant, which wea fewer mes...
Butler W. Lampson, David B. Lomet
DASFAA
2007
IEEE
169views Database» more  DASFAA 2007»
14 years 4 months ago
The Circular Two-Phase Commit Protocol
Abstract. Distributed transactional systems require an atomic commitment protocol to preserve atomicity of the ACID properties. However, the industry leading standard, 2PC, is slow...
Heine Kolltveit, Svein-Olaf Hvasshovd