| HAL: hal-00003362, version 1 |
| arXiv: cs/0411095 |
| Detailed view | Export this paper |
|
|
| Parallel Processing Letters 12, 3-4 (2002) 297-310 |
|
|
|
|
| Embeddings into the Pancake Interconnection Network |
|
|
| Christian Lavault 1 |
|
|
| (2002) |
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'informatique de Paris-nord (LIPN) |
| CNRS : UMR7030 – Université Paris XIII - Paris Nord | |
|
|
|
|
|
|
|
|
| OCAD |
|
|
|
|
| Subject | : | Computer Science/Distributed, Parallel, and Cluster Computing Computer Science/Data Structures and Algorithms Computer Science/Discrete Mathematics |
|
|
| Attached file list to this document: | ||||||||||
|
|
|
| hal-00003362, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00003362 | |
| oai:hal.archives-ouvertes.fr:hal-00003362 | |
| From: Christian Lavault | |
| Submitted on: Friday, 26 November 2004 18:08:14 | |
| Updated on: Friday, 8 June 2007 15:13:34 | |