Embedding meshes on the star graph

Authors:
Sanjay Ranka;Jhychun Wang;Nangkang Yeh
Affiliations:
4-116 Center for Science and Technology, School of Computer and Information Science, Syracuse University, Syracuse, NY;4-116 Center for Science and Technology, School of Computer and Information Science, Syracuse University, Syracuse, NY;4-116 Center for Science and Technology, School of Computer and Information Science, Syracuse University, Syracuse, NY
Venue:
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Year:
1990

Citing 9
Cited 2

Topological Properties of Hypercubes

IEEE Transactions on Computers
On Embedding Rectangular Grids in Hypercubes

IEEE Transactions on Computers
On Multidimensional Arrays of Processors

IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Two nearly optimal sorting algorithms for mesh-connected processor arrays using shear-sort

Journal of Parallel and Distributed Computing
Graph Problems on a Mesh-Connected Processor Array

Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer

Communications of the ACM
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing
Programming a Hypercube Multicomputer

IEEE Software

Efficient fault-tolerant routing algorithm for OTIS-cube using unsafety vectors

Proceedings of the 2004 ACM symposium on Applied computing
Embedding a family of disjoint multi-dimensional meshes into a crossed cube

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop algorithms for mapping n-dimensional meshes on a star graph of degree n with expansion 1 and dilation 3. We show that an n-degree star graph can efficiently simulate an n-dimensional mesh.