The Communication Complexity of Atomic Commitment and of Gossiping

DOI10.1137/0220027MaRDI QIDQ3359736zbMATH OpenOpenAlexFDO

Authors 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

commit protocoldatabase consistencydistributed databasegossipingoptimal protocollstransaction management

Mathematics Subject Classification ID

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

Recommendations

• Communication complexity of fault-tolerant information diffusion
• Communication complexity of gossiping by packets
• Communication complexity of gossiping by packets
• Complexity of distributed commit protocols
• scientific article; zbMATH DE number 1202979

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3359736)