ACM Home Page
Please provide us with feedback. Feedback
A weighted voting algorithm for replicated directories
Full text PdfPdf (4.12 MB)
Source Journal of the ACM (JACM) archive
Volume 34 ,  Issue 4  (October 1987) table of contents
Pages: 859 - 909  
Year of Publication: 1987
ISSN:0004-5411
Authors
Joshua J. Bloch  Carnegie Mellon Univ., Pittsburgh, PA
Dean S. Daniels  Carnegie Mellon Univ., Pittsburgh, PA
Alfred Z. Spector  Carnegie Mellon Univ., Pittsburgh, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 36,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/31846.31847
What is a DOI?

ABSTRACT

Weighted voting is used as the basis for a replication technique for directories. This technique affords arbitrarily high data availability as well as high concurrency. Efficient algorithms are presented for all of the standard directory operations. A structural property of the replicated directory that permits the construction of an efficient algorithm for deletion is proven. Simulation results are presented and the system is modeled and analyzed. The analysis agrees well with the simulation, and the space and time performance are shown to be good for all configurations of the system.


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.

 
1
2
 
3
4
5
 
6
BmMAN, K. P., SKEEN, D., EL ABBADI, A., DIETRICH, W. C., AND RAEUCHLE, T. Isis: An environment for constructing fault-tolerant distributed systems. Res. Rep. 83-552, Cornell Univ., Ithaca, N.Y., 1983.
7
8
9
10
11
12
 
13
GIFFORD, D.K. Information storage in a decentralized computer system. Res. Rep. CSL-81-8, Xerox Research Center, Palo Alto, Calif., March 1982.
 
14
GRAY, J.N. A transaction model. Res. Rep. RJ2895, IBM Research Laboratory, San Jose, Calif., Aug. 1980.
15
 
16
HERLIHY, M.P. Availability vs. atomicity: Concurrency control for replicated data. Res. Rep. CMU-CS-85-108, Carnegie-Mellon Univ., Pittsburgh, Pa., Feb. 1985.
17
 
18
IBM CORPORATION. ACP system: Concept and facilities. GH20-1473-I edition, IBM, White Plains, New York, 1975.
 
19
KEMENY, J. G., AND SNELL, J.L. FinRe Markov Chains. Van Nostrand, New York, 1960.
20
 
21
LINDSAY, B. G., SELINGER, P. S., GALTIERI, C., GRAY, J. N., LORIE, R. A., PRICE, T. G., PUTZOLU, F., TRAIGER, I. L., AND WADE, B. W. Notes on distributed databases. In Distributed Databases, I. W. Draffan and F. Poole, Eds. Cambridge University Press, Cambridge, England, 1980, pp. 247-284.
22
23
 
24
ROTHmE, J. B., Ca~OMAN, N., AND BERNSTEIN, P.A. The redundant update methodology of SDD-I: A system for distributed databases (the fully redundant case). Tech. Rep. CCA-77-02, Computer Corporation of America, Cambridge, Mass., 1977.
 
25
26
27
 
28
SPECTOR, A. Z., BUTCHER, J., DANIEL.% D. S., DUCHAMP, D. j., EPPINGER, J. L., "FINEMAN, C. E., HEODAYA, A., AND SCHWARZ, P.M. Support for distributed transactions in the TABS prototype. IEEE Trans. Softw. Eng. SE-11, 6 (June 1985), 520-530.
29
30
31
32



REVIEW

"Armin B. Cremers : Reviewer"

The research reported here was done as part of the TABS (transaction-based systems) project, whose aim was to construct a distributed transaction facility that supports operations on shared data objects. A directory is defined as a shared data o  more...

Collaborative Colleagues:
Joshua J. Bloch: colleagues
Dean S. Daniels: colleagues
Alfred Z. Spector: colleagues