000050005 001__ 50005
000050005 005__ 20180317092802.0
000050005 037__ $$aCONF
000050005 245__ $$aProcessing Transactions over Optimistic Atomic Broadcast Protocols
000050005 269__ $$a1999
000050005 260__ $$c1999
000050005 336__ $$aConference Papers
000050005 520__ $$aAtomic broadcast primitives allow fault-tolerant cooperation between sites in adistributed 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 which, based on optimistic assumptions about the communication system, reduces the average delay for message delivery.  In this paper, we develop this idea further and present a replicated database architecture that employs the new atomic broadcast primitive in such a way that the coordination phase of the atomic broadcast is fully overlapped with the   
000050005 700__ $$aKemme, B.
000050005 700__ $$0241707$$aPedone, F.$$g112421
000050005 700__ $$aAlonso, G.
000050005 700__ $$0241767$$aSchiper, A.$$g106377
000050005 773__ $$tProceedings of 19th International Conference on Distributed Computing Systems (ICDCS'99)
000050005 8564_ $$s131413$$uhttps://infoscience.epfl.ch/record/50005/files/KPA%2B99.pdf$$zn/a
000050005 909CO $$ooai:infoscience.tind.io:50005$$pIC$$pconf
000050005 909C0 $$0252206$$pLSR$$xU10411
000050005 937__ $$aLSR-CONF-1999-006
000050005 970__ $$aKPA+99/LSR
000050005 973__ $$aEPFL$$sPUBLISHED
000050005 980__ $$aCONF