Embeddings into the pancake interconnection network

Authors:
H. Senoussi;C. Lavault
Affiliations:
-;-
Venue:
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Year:
1997

Citing 4
Cited 2

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group

IEEE Transactions on Computers
Embedding Complete Binary Trees into Star Networks

MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Variable-Dilation Embeddings of Hypercubes into Star Graphs: Performance Metrics, Mapping Functions, and Routing

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I

A comparative study of job allocation and migration in the pancake network

Information Sciences: an International Journal
A parallel algorithm for interpolation in pancake graph

SEPADS'07 Proceedings of the 6th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. Some good properties of this interconnection network include: vertex symmetry, small degree and diameter, extendability, and high connectivity (robustness). We present constant dilation embeddings of rings, grids, and hypercubes into the pancake. We also show that some of these embeddings lead to similar efficient embeddings into the star graph.