We introduce and analyze a new interconnection topology, called the n-folded Petersen network(F Pn), which is constructed by iteratively applying the cartesian product operation on the well-known Petersen graph itself. The FPn 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 Pn has smaller diameter and accommodates more nodes than the 3n-dimensional binary hypercube. This paper also emphasizes the versatility of FPn 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.
CITATION STYLE
Öhring, S. R., & Das, S. K. (1994). The folded petersen network : A new versatile multiprocessor interconneetion topology. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 790 LNCS, pp. 301–314). Springer Verlag. https://doi.org/10.1007/3-540-57899-4_61
Mendeley helps you to discover research relevant for your work.