Embeddings into the Pancake Interconnection Network
Abstract
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In this paper, we present embeddings of rings, grids and hypercubes into the pancake with constant dilation and congestion. We also extend the results to similar efficient embeddings into the star graph.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2004
- DOI:
- arXiv:
- arXiv:cs/0411095
- Bibcode:
- 2004cs.......11095L
- Keywords:
-
- Computer Science - Distributed;
- Parallel;
- and Cluster Computing;
- Computer Science - Discrete Mathematics;
- Computer Science - Data Structures and Algorithms
- E-Print:
- Article paru en 2002 dans Parallel Processing Letters