Open access
Author
Date
1991Type
- Report
ETH Bibliography
yes
Altmetrics
Abstract
We propose a distributed dictionary that tolerates arbitrary single server crashes. The distinctive feature of our model is that the crash of a server cannot be detected. This is in contrast to all other proposals of distributed fault tolerant search structures presented thus far. It reflects the real situation in the internet more accurately, and is in general more suitable to complex overall conditions. This makes our solution fundamentally dierent from all previous ones, but also more complicated. We present in detail the algorithms for searching, insertion, and graceful recovery of crashed servers. Show more
Permanent link
https://doi.org/10.3929/ethz-a-000597280Publication status
publishedJournal / series
ETH, Eidgenössische Technische Hochschule Zürich, Departement Informatik, Institut für ComputersystemeVolume
Publisher
Eidgenössische Technische Hochschule ZürichSubject
COMPUTERGRAFIK (SOFTWAREPRODUKTE); COMPUTER GRAPHICS (SOFTWARE PRODUCTS); COMPUTATIONAL GEOMETRY + GEOMETRIC COMPUTATIONS; BERECHENBARE GEOMETRIE + COMPUTERGEOMETRIE; COMPUTERGRAFIK; COMPUTER GRAPHICSOrganisational unit
02150 - Dep. Informatik / Dep. of Computer Science
More
Show all metadata
ETH Bibliography
yes
Altmetrics