Compact deterministic distributed dictionaries

Kami Gilon, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages81-94
Number of pages14
ISBN (Print)0897914392
DOIs
StatePublished - 1 Jul 1991
Externally publishedYes
Event10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991 - Montreal, Canada
Duration: 19 Aug 199121 Aug 1991

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991
Country/TerritoryCanada
CityMontreal
Period19/08/9121/08/91

Bibliographical note

Publisher Copyright:
© 1991 ACM

Fingerprint

Dive into the research topics of 'Compact deterministic distributed dictionaries'. Together they form a unique fingerprint.

Cite this