The Communication Complexity of Atomic Commitment and of Gossiping

DOI10.1137/0220027zbMath0733.68008OpenAlexW2093534044MaRDI QIDQ3359736

Ouri Wolfson, Adrian Segall

Publication date: 1991

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0220027

zbMATH Keywords

gossipingtransaction managementdistributed databasecommit protocoldatabase consistencyoptimal protocolls

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Network design and communication in computer systems (68M10) Information storage and retrieval of data (68P20)

Related Items (10)

Methods and problems of communication in usual networks ⋮ On the communication complexity of polling ⋮ Colouring paths in directed symmetric trees with applications to WDM routing ⋮ Reordered gossip schemes ⋮ Concurrent multicast in weighted networks ⋮ Concurrent multicast in weighted networks ⋮ Communication complexity of gossiping by packets ⋮ A distributed algorithm to obtain repeated games equilibria with discounting ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Efficient collective communciation in optical networks

This page was built for publication: The Communication Complexity of Atomic Commitment and of Gossiping