The Communication Complexity of Atomic Commitment and of Gossiping
From MaRDI portal
Publication:3359736
DOI10.1137/0220027zbMath0733.68008MaRDI QIDQ3359736
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
gossiping; transaction management; distributed database; commit protocol; database consistency; optimal protocolls
68Q25: Analysis of algorithms and problem complexity
68P15: Database theory
68M10: Network design and communication in computer systems
68P20: Information storage and retrieval of data
Related Items
Concurrent multicast in weighted networks, 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, Reordered gossip schemes