Sciweavers

202 search results - page 7 / 41
» Consensus on Transaction Commit
Sort
View
SOSP
2007
ACM
15 years 6 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...
ICPADS
1998
IEEE
15 years 2 months ago
One-Phase Commit: Does it make Sense?
1 Although widely used in distributed transactional systems, the so-called Two-Phase Commit (2PC) protocol introduces a substantial delay in transaction processing, even in the abs...
Maha Abdallah, Rachid Guerraoui, Philippe Pucheral
CCR
1998
128views more  CCR 1998»
14 years 9 months ago
OSI distributed transaction processing commitment optimizations
: This paper briefly summarizes the work towards the final version of ‘Distributed Transaction Processing’ (OSI TP). Several well-known optimizations of the presumed abort prot...
Richard Banks, Peter Furniss, Klaus Heien, Hans-R&...
EUROSYS
2006
ACM
15 years 6 months ago
Tashkent: uniting durability with transaction ordering for high-performance scalable database replication
In stand-alone databases, the two functions of ordering the transaction commits and making the effects of transactions durable are generally performed in one action, namely in the...
Sameh Elnikety, Steven G. Dropsho, Fernando Pedone
HPCC
2009
Springer
15 years 2 months ago
On the Performance of Commit-Time-Locking Based Software Transactional Memory
Compared with lock-based synchronization techniques, Software Transactional Memory (STM) can significantly improve the programmability of multithreaded applications. Existing res...
Zhengyu He, Bo Hong