๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Distributed Search Trees: Fault Tolerance in an Asynchronous Environment

โœ Scribed by Konrad Schlude; Eljas Soisalon-Soininen; Peter Widmayer

Book ID
105914735
Publisher
Springer
Year
2003
Tongue
English
Weight
255 KB
Volume
36
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An adaptive approach to achieving hardwa
An adaptive approach to achieving hardware and software fault tolerance in a distributed computing environment
โœ A. Bondavalli; S. Chiaradonna; F. Di Giandomenico; J. Xu ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 356 KB

This paper focuses on the problem of providing tolerance to both hardware and software faults in independent applications running on a distributed computing environment. Several hybrid-fault-tolerant architectures are identified and proposed. Given the highly varying and dynamic characteristics of t

A distributed algorithm for embedding tr
A distributed algorithm for embedding trees in hypercubes with modifications for run-time fault tolerance
โœ Foster J. Provost; Rami Melhem ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 588 KB

In this paper we present a distributed algorithm for embedding binary trees in hypercubes. Starting with the root (invoked in some cube node by a host), each node is responsible for determining the addresses of its children, and for invoking the embedding algorithm for the subtree rooted at each chi