Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data

From MaRDI portal
Publication:1183495
Jump to:navigation, search

DOI10.1016/0020-0190(91)90199-RzbMath0749.68010MaRDI QIDQ1183495

Akhil Kumar, Shun Yan Cheung

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)


zbMATH Keywords

distributed systemssynchronizationfault tolerancereplicated data managementquorum consensusreplica control protocol


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)


Related Items (6)

Billiard quorums on the grid ⋮ Optimal availability quorum systems: theory and practice ⋮ Optimizing the costs of hierarchical quorum consensus ⋮ A fully distributed quorum consensus method with high fault-tolerance and low communication overhead ⋮ Crumbling walls: a class of practical and efficient quorum systems ⋮ The availability of crumbling wall quorum systems



Cites Work

  • Exploiting logical structures in replicated databases
  • How to assign votes in a distributed system


This page was built for publication: A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1183495&oldid=12050022"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki