000050006 001__ 50006
000050006 005__ 20190117192740.0
000050006 037__ $$aREP_WORK
000050006 245__ $$aUsing Optimistic Atomic Broadcast in Transaction Processing Systems
000050006 269__ $$a1999
000050006 260__ $$c1999
000050006 336__ $$aReports
000050006 520__ $$aAtomic broadcast primitives are often proposed as a mechanism to allow fault-tolerant cooperation between sites in a distributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, scalable applications on top of atomic broadcast primitives. Recently, a new approach has been proposed for atomic broadcast which, based on optimistic assumptions about the communication system, reduces the average delay for message delivery to the application. In this paper, we develop this idea further and show how applications can take even more advantage of the optimistic assumption by overlapping the coordination phase of the atomic broadcast algorithm with the processing of delivered messages. In particular, we present a replicated database architecture that employs the new atomic broadcast primitive in such a way that communication and transaction processing are fully overlapped, providing high performance without relaxing transaction correctness. 
000050006 700__ $$aKemme, B.
000050006 700__ $$0241707$$aPedone, F.$$g112421
000050006 700__ $$aAlonso, G.
000050006 700__ $$0241767$$aSchiper, A.$$g106377
000050006 8564_ $$s303985$$uhttps://infoscience.epfl.ch/record/50006/files/KPA%2B99b.pdf$$zn/a
000050006 909CO $$ooai:infoscience.tind.io:50006$$preport$$pIC
000050006 909C0 $$0252206$$pLSR$$xU10411
000050006 937__ $$aLSR-REPORT-1999-012
000050006 970__ $$aKPA+99b/LSR
000050006 973__ $$aEPFL$$sPUBLISHED
000050006 980__ $$aREPORT