| Crumbling walls: a class of practical and efficient quorum systems |
| Full text |
Pdf
(1.04 MB)
|
| Source
|
Annual ACM Symposium on Principles of Distributed Computing
archive
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
table of contents
Ottowa, Ontario, Canada
Pages: 120 - 129
Year of Publication: 1995
ISBN:0-89791-710-3
|
|
Authors
|
|
David Peleg
|
Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel
|
|
Avishai Wool
|
Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 27, Citation Count: 15
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
ADKM92
|
Y. Amir, D. Dolev, S. Kramer, and D. Malki. Transis: A communication subsystem for high availability. In Proc. ~~nd Inter. Syrup. Fault- Tolerant Comp. Sys., pages 76-84, 1992.
|
 |
AE91
|
|
| |
BG87
|
|
| |
CAA90
|
|
| |
Con
|
N. Condorcet. Essai sur l'application de l'analyse ~ la probabilit~ des decisions rendues k la pluralite des voix. Paris, 1785.
|
 |
DGS85
|
|
| |
DKK+94
|
Krzysztof Diks , Evangelos Kranakis , Danny Krizanc , Bernard Mans , Andrzej Pelc, Optimal coteries and voting schemes, Information Processing Letters, v.51 n.1, p.1-6, July 12, 1994
[doi> 10.1016/0020-0190(94)00064-6]
|
| |
EL75
|
P. ErdSs and L. Lov~sz. Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and Finite Sets, pages 609-627. Colloq. Math. Soc. J~nos Bolyai 10, 1975.
|
 |
GB85
|
|
 |
Gif79
|
|
| |
Her84
|
|
| |
HMP95
|
|
| |
HR90
|
|
| |
IK93
|
|
| |
KC91
|
|
| |
Knu68
|
|
| |
KRS93
|
A. Kumar, M. Rabinovich, and R. K. Sinha. A performance study of general grid structures for replicated data. In Proc. Inter. Conf. Dist. Comp. Sys., 1993.
|
| |
Kum91
|
|
| |
Lov73
|
L. Lov~sz. Coverings and colorings of hypergraphs. In Proc. ~th Southeastern Con/. Combinatorics, Graph Theory and Computing, pages 3-12, 1973.
|
 |
Mae85
|
|
| |
MP92a
|
Y. Marcus and D. Peleg. Construction methods for quorum systems. Technical Report CS92- 33, The Weizrnann Institute of Science, Rehovot, Israel, 1992.
|
| |
MP92b
|
Y. Marcus and D. Peleg. Load balancing in quorum systems. Technical Report CS92-34, The Weizmann Institute of Science, Rehovot, Israel, 1992.
|
| |
MV88
|
S.J. Mullender and P. M. B. Vit~nyi. Distributed match-making. Algorithmica, 3:367- 391, 1988.
|
| |
Nei92
|
|
| |
NW94
|
M. Naor and A. Wool. The load, capacity and availability of quorum systems. In Proc. 35th IEEE Syrup. Found. o/Comp. Science, pages 214-225, 1994.
|
| |
NW95a
|
|
| |
NW95b
|
M. Naor and A. Wool. Access control and signatures via quorum secret sharing, 1995. Manuscript.
|
| |
PW93
|
|
| |
PW94
|
|
| |
Ray86
|
|
| |
RST92
|
|
| |
RT91
|
|
| |
SB94
|
|
 |
Tho79
|
|
| |
YG94
|
|
CITED BY 15
|
|
Dahlia Malkhi , Michael Reiter , Rebecca Wright, Probabilistic quorum systems, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.267-273, August 21-24, 1997, Santa Barbara, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
David Peleg , Avishai Wool, How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract), Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, p.290-299, May 23-26, 1996, Philadelphia, Pennsylvania, United States
|
|
|
|
|
|
Govind Krishnamurthi , Murat Azizoğlu , Arun K. Somani, Optimal location management algorithms for mobile networks, Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, p.223-232, October 25-30, 1998, Dallas, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|