A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data (Q1183495): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Exploiting logical structures in replicated databases / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How to assign votes in a distributed system / rank | |||
Normal rank | |||
Latest revision as of 15:48, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data |
scientific article |
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
