Congestion and fault tolerance of binary tree embeddings on hypercube

Efe, Kemal; Ramaiyer, Kumar

doi:10.1109/ipps.1991.153819

Cited by 6 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These applications are characterized by the data mapping scheme that preserves data adjacency for convenient neighborhood communication, and the concurrent tree operations of each data set. The tree operations we consider are special cases of a type of binary tree algorithms, called normal algorithms [4], in which only one level of nodes is active at a time.…”

Section: Introductionmentioning

confidence: 99%

On constructing multiple spanning trees in a hypercube

Wang

Lin

1993

Information Processing Letters

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

On constructing multiple spanning trees in a hypercube

Wang

Lin

1993

Information Processing Letters

View full text Add to dashboard Cite

“…High congestion mapping (HCM) [2] uses the concept of folding, in which larger task graphs can be embedded into1 the smaller cubes with minimal cost. Therefore, HCM requires a higher node congestion compared to regular mappings.…”

Section: High Congestion Mappingmentioning

confidence: 99%

Efficient implementation strategies for the DRB approach in fault-tolerant hypercubes

Williams

Tan²,

Liang³

Proceedings Twenty-First Annual International Computer Software and Applications Conference (COMPSAC'97)

View full text Add to dashboard Cite

The Distributed Recovery Block (DRB) is an efficient approach for the uniform treatment of hardware and software faults in real-time applications. Full DRB mapping assigns each task of an application tasks graph to run on a pair of processor nodes. The primary cost factors that determine it? efJiciency are dilation bound, expansion factor and congestion. In this paper, two alternative schemes are described that improves the DRB approach. The first describes a mapping of application tasks such that each node in the hypercube executes one or more application tasks in the lifetime of a task graph. The second scheme incorporates spare processors to provide an efficient architecture for implementing the DRB approach.

show abstract

Reconfiguration of faulty hypercubes

Avresky

Al-Tawil

1994

Dependable Computing — EDCC-1

View full text Add to dashboard Cite

Congestion and fault tolerance of binary tree embeddings on hypercube

Cited by 6 publications

References 5 publications

On constructing multiple spanning trees in a hypercube

On constructing multiple spanning trees in a hypercube

Efficient implementation strategies for the DRB approach in fault-tolerant hypercubes

Reconfiguration of faulty hypercubes

Contact Info

Product

Resources

About