Affordable Access

Publisher Website

Distributed fault-tolerant embeddings of rings in hypercubes

Authors
Journal
Journal of Parallel and Distributed Computing
0743-7315
Publisher
Elsevier
Publication Date
Volume
11
Issue
1
Identifiers
DOI: 10.1016/0743-7315(91)90071-g
Disciplines
  • Computer Science

Abstract

Abstract This paper contributes simple distributed algorithms for successfully embedding a ring of size at least 2 n −2 f in an n-cube with f ⩽⌞(n + 1)/2⌟ faults. Only local knowledge of faults is assumed with each processor aware of the status of only its immediate neighbors. The algorithms work in many cases where f exceeds ⌞(n + 1)/2⌞.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Highly fault-tolerant cycle embeddings of hypercub...

on Journal of Systems Architectur... Jan 01, 2007

Fault-Tolerant Permutation Routing in Hypercubes

on Journal of Parallel and Distri... Jan 01, 1993

Fault-Tolerant Multicasting on Hypercubes

on Journal of Parallel and Distri... Jan 01, 1994
More articles like this..