Abstract
The folded Petersen network is constructed by iteratively applying the cartesian product operation on the well-known Petersen graph. This topology provides regularity, node- and edge-symmetry, optimal connectivity (and therefore maximal fault-tolerance), logarithmic diameter and modularity. With the same node-degree and connectivity, the n-folded Petersen network, F P n , has smaller diameter with more nodes than the 3n-dimensional binary hypercube Q 3n , and its packing density is higher compared to several other product networks.
In this paper, we consider several fundamental communication problems on the folded Petersen network: sending a message from one node to another (or routing), permutation routing, i.e., every node is source and destination of precisely one message, broadcasting a message from a source to all other nodes (one- to- all broadcasting), sending the same message from every node to all other nodes (multinode-broadcasting or gossiping), personalized communications like scattering (sending from a single node distinct messages to each one of the other nodes) and total exchange (each node sending distinct messages to all other nodes).
All of these communication problems are studied under two assumptions, the single link availability (SLA) in which each node can send or receive messages over a single link at each time step, and the multiple link availability (MLA) in which each node can exchange messages with all of its neighbors at each time step. We derive lower bounds for these problems and design optimal algorithms in terms of both time and the number of message transmissions. The results are based on the construction of optimal height spanning trees in the folded Petersen network F P n .
This work is partially supported by Texas Advanced Research Program Grants TARP-003594003 and TATP-003594031.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays — Trees — Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, 1992.
B. Monien and H. Sudborough. Embedding one interconnection network in another. In Computational Graph Theory, pages 257–282, Wien, 1990. Springer Verlag.
G. Chartrand and R.J. Wilson. The Petersen graph. Graphs and Applications (Eds. F. Harary and J.S. Maybee), pages 69–100, 1985.
S. Öhring and S.K. Das. The folded Petersen network: A new communication-efficient multiprocessor topology. In Proceedings of the 1993 International Conference on Parallel Processing, Volume I, pages 311–314, Aug. 1993.
S. Öhring and S.K. Das. Mapping dynamic data and algorithm structures into product networks. In Proc. 4th International Symposium on Algorithms and Computation (ISAAC'93), Hong Kong, Lecture Notes in Computer Science, vol. 762, pages 147–156, Dec. 15–17 1993.
S.L. Johnsson. Communication efficient basic linear algebra computations on hypercube architectures. Journal of Parallel and Distributed Computing, 4, 1987.
D.P. Bertsekas, C. özveren, G.D. Stamoulis, P. Tseng, and J.N. Tsitsiklis. Optimal communication algorithms for hypercubes. Journal of Parallel and Distributed Computing, 11:263–275, 1991.
S.L. Johnsson and C.-T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Transaction on Computers, 38(9): 1249–1268, Sep. 1989.
W.-J. Hsu. Fibonacci cubes: A new interconnection topology. IEEE Transactions on Parallel and Distributed Systems, Vol. 4, No. 1:3–12, Jan. 1993.
P. Fragopoulou and S.G. Akl. Optimal communication algorithms on the star interconnection network. In Proc. of the Fifth IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, pages 702–711, Dec. 1993.
P. Fraigniaud and E. Lazard. Methods and problems of communication in usual networks. Technical Report Rapport LIP 91-33, Université de Paris-Sud, France, 1991.
L. Bhuyan and D.P. Agrawal. Generalized hypercubes and hyperbus structures for a computer network. IEEE Transactions on Computers, C-33:323–333, 1984.
E. Ganesan and D.K. Pradhan. The hyper-de bruijn networks: Scalable versatile architecture. IEEE Transactions on Parallel and Distributed Systems, 4(9):962–978, 1993.
S.K. Das and A.K. Banerjee. Hyper Petersen network: Yet another hypercube-like topology. In Proceedings of the 4th Symposium on the Frontiers of Massively Parallel Computation (Frontiers' 92), pages 270–277, McLean, Virginia, USA, Oct. 1992.
S.K. Das, S. öhring, and A.K. Banerjee. Embeddings into hyper Petersen networks: Yet another hypercube-like interconnection topology, accepted for publication in Journal of VLSI Design (special Issue on Interconnection Networks), 1994.
S. öhring and S.K. Das. The folded Petersen cube networks: New competitors for the hypercube. In Proc. of the Fifth IEEE Symposium on Parallel and Distributed Computing, pages 582–589, Dec. 1993.
A. Youssef. Cartesian product networks. In Procedings of the 1991 International Conference on Parallel Processing, Vol. I, pages 684–685, 1991.
Jop Sibeyn. personal communication, September 1993.
S. öhring, D.H. Hohndel, and S.K. Das. Fault tolerant communication algorithms on the folded Petersen networks based on arc-disjoint spanning trees. Technical Report CRPDC-94-4, University of Wuerzburg, University of North Texas, February 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Öhring, S.R., Das, S.K. (1994). Efficient communication in the folded Petersen interconnection networks. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_87
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_87
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive