Distributed data structures: A complexity-oriented view

David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations

Abstract

The problem of designing, implementing and operating a data structure in a distributed system is studied from a complexity oriented point of view. Various relevant issues are addressed via the development of an example structure. The structure evolves through a sequence of steps, each oriented towards attacking a different aspect of the problem. The paper concentrates on deterministic structures featuring low memory requirements, memory balance and efficient access protocols. Among the issues treated are centerless organizations of data structures, background maintenance of memory balancing, employing redundancy for increasing search efficiency and concurrent accesses to distributed structures.

Original languageEnglish
Title of host publicationDistributed Algorithms - 4th International Workshop, Proceedings
EditorsJan van Leeuwen, Nicola Santoro
PublisherSpringer Verlag
Pages71-89
Number of pages19
ISBN (Print)9783540540991
DOIs
StatePublished - 1991
Externally publishedYes
Event4th International Workshop on Distributed Algorithms, WDAG 1990 - Bari, Italy
Duration: 24 Sep 199026 Sep 1990

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume486 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Workshop on Distributed Algorithms, WDAG 1990
Country/TerritoryItaly
CityBari
Period24/09/9026/09/90

Bibliographical note

Publisher Copyright:
© 1991, Springer Verlag. All rights reserved.

Fingerprint

Dive into the research topics of 'Distributed data structures: A complexity-oriented view'. Together they form a unique fingerprint.

Cite this