Embeddings into the Pancake Interconnection Network

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
Article paru en 2002 dans Parallel Processing Letters

Keywords

Distributed, Parallel, and Cluster Computing, Discrete Mathematics, Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32461

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0411095
 http://arxiv.org/abs/cs/0411095
 Parallel Processing Letters 12, 3-4 (2002) 297-310

Collections

arXiv