Compact deterministic distributed dictionaries

Kami Gilon; David Peleg

doi:10.1145/112600.112609

Compact deterministic distributed dictionaries

Kami Gilon
, David Peleg

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

This paper handles the problem of designing a deterministic dictionary structure in a distributed system. The structure is required to be compact (namely, store only a single copy of each data item) and memory balanced, and to have efficient access protocols. Several structures are presented, achieving near-optimal performance with respect to memory requirements and communication complexity.

Original language	English
Title of host publication	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
Publisher	Association for Computing Machinery
Pages	81-94
Number of pages	14
ISBN (Print)	0897914392
DOIs	https://doi.org/10.1145/112600.112609
State	Published - 1 Jul 1991
Externally published	Yes
Event	10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991 - Montreal, Canada Duration: 19 Aug 1991 → 21 Aug 1991

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991
Country/Territory	Canada
City	Montreal
Period	19/08/91 → 21/08/91

Bibliographical note

Publisher Copyright:
© 1991 ACM

Access to Document

10.1145/112600.112609

Cite this

@inproceedings{2cfa82f4cd40490aa8044ce89b1f42cd,

title = "Compact deterministic distributed dictionaries",

abstract = "This paper handles the problem of designing a deterministic dictionary structure in a distributed system. The structure is required to be compact (namely, store only a single copy of each data item) and memory balanced, and to have efficient access protocols. Several structures are presented, achieving near-optimal performance with respect to memory requirements and communication complexity.",

author = "Kami Gilon and David Peleg",

note = "Publisher Copyright: {\textcopyright} 1991 ACM; 10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991 ; Conference date: 19-08-1991 Through 21-08-1991",

year = "1991",

month = jul,

day = "1",

doi = "10.1145/112600.112609",

language = "אנגלית",

isbn = "0897914392",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "81--94",

booktitle = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

}

Gilon, K & Peleg, D 1991, Compact deterministic distributed dictionaries. in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, pp. 81-94, 10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991, Montreal, Canada, 19/08/91. https://doi.org/10.1145/112600.112609

Compact deterministic distributed dictionaries. / Gilon, Kami; Peleg, David.
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 1991. p. 81-94 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Compact deterministic distributed dictionaries

AU - Gilon, Kami

AU - Peleg, David

PY - 1991/7/1

Y1 - 1991/7/1

N2 - This paper handles the problem of designing a deterministic dictionary structure in a distributed system. The structure is required to be compact (namely, store only a single copy of each data item) and memory balanced, and to have efficient access protocols. Several structures are presented, achieving near-optimal performance with respect to memory requirements and communication complexity.

AB - This paper handles the problem of designing a deterministic dictionary structure in a distributed system. The structure is required to be compact (namely, store only a single copy of each data item) and memory balanced, and to have efficient access protocols. Several structures are presented, achieving near-optimal performance with respect to memory requirements and communication complexity.

UR - https://www.scopus.com/pages/publications/84870815270

U2 - 10.1145/112600.112609

DO - 10.1145/112600.112609

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84870815270

SN - 0897914392

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 81

EP - 94

BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

T2 - 10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991

Y2 - 19 August 1991 through 21 August 1991

ER -

Compact deterministic distributed dictionaries

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this