The folded Petersen network: A new versatile multiprocessor interconnection topology

Abstract

We introduce and analyze a new interconnection topology, called the n-folded Petersen network(F P n ), which is constructed by iteratively applying the cartesian product operation on the well-known Petersen graph itself. The FP n topology provides regularity, node- and edge-symmetry, optimal connectivity (and therefore maximal fault-tolerance), logarithmic diameter, modularity, and simple routing and broadcasting algorithms even in the presence of faults. With the same node-degree and connectivity, F P n has smaller diameter and accommodates more nodes than the 3n-dimensional binary hypercube.This paper also emphasizes the versatility of FP n as a multiprocessor interconnection topology by providing embeddings of many computationally important structures such as rings, multi-dimensional meshes, hypercubes, complete binary trees, X-trees, tree machines, pyramids and dynamically evolving binary trees.Keywordsbroadcastingtreeembeddingfault-tolerancehypercubeinterconnection networkmeshPetersen graphrouting