Embeddings into the Pancake Interconnection Network

TL;DR

This paper explores efficient embeddings of common network topologies like rings, grids, and hypercubes into the pancake interconnection network, demonstrating constant dilation and congestion, and extending results to star graphs.

Contribution

It introduces new embeddings of various network topologies into the pancake graph with optimal parameters, enhancing interconnection network design.

Findings

Embeddings of rings, grids, and hypercubes with constant dilation and congestion.

Extensions of embeddings to the star graph.

Improved interconnection network efficiency.

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.