A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data (Q1183495)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data |
scientific article; zbMATH DE number 33332
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data |
scientific article; zbMATH DE number 33332 |
Statements
A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data (English)
0 references
28 June 1992
0 references
We describe and analyze a hierarchical grid protocol and its properties, give a correctness proof of the protocol, and show that it overcomes the problem of low availability, while still maintaining the same quorum sizes as in a simple grid.
0 references
replica control protocol
0 references
replicated data management
0 references
distributed systems
0 references
fault tolerance
0 references
quorum consensus
0 references
synchronization
0 references
