Embeddings into the Pancake Interconnection Network

Simple item page
dc.creatorLavault, Christian
dc.date2004-11-26
dc.date.accessioned2026-07-07T03:22:05Z
dc.date.available2026-07-07T03:22:05Z
dc.descriptionOwing 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.
dc.descriptionArticle paru en 2002 dans Parallel Processing Letters
dc.identifierhttps://arxiv.org/abs/cs/0411095
dc.identifierhttp://arxiv.org/abs/cs/0411095
dc.identifierParallel Processing Letters 12, 3-4 (2002) 297-310
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32461
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.titleEmbeddings into the Pancake Interconnection Network
dc.typetext

Files

Collections

arXiv