submit
english version rss feed
HAL: hal-00003362, version 1

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
Computer Science/Distributed, Parallel, and Cluster Computing

Computer Science/Data Structures and Algorithms

Computer Science/Discrete Mathematics
Attached file list to this document: 
PS
pancakePPL02.ps(142.7 KB)
PDF
pancakePPL02.pdf(141.1 KB)

all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...