Minimal Mesh Embeddings in Binary Hypercubes

Authors:
D. S. Scott;J. Brandenburg
Affiliations:
Intel, Beaverton, OR;Intel, Beaverton, OR
Venue:
IEEE Transactions on Computers
Year:
1988

Citing 0
Cited 4

A method for them embedding of arbitrary communication topologies into configurable parallel computers

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
A greedy hypercube-labeling algorithm

ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Optimal Processor Assignment for a Class of Pipelined Computations

IEEE Transactions on Parallel and Distributed Systems
Pyramidal thinning algorithm for SIMD parallel machines

Pattern Recognition

Quantified Score

Hi-index	14.98

Visualization

Abstract

The authors state and prove a result about minimal graph embeddings of meshes into hypercubes. This corrects a flaw in a previously published proof by D.W. Krumme and K.N. Venkataraman (1986).