Asymptotically optimal communication algorithms on faulty folded petersen networks
Efficient data communication through an interconnection network in the presence of faulty nodes and links is an important issue in multiprocessor systems. The newly proposed folded Petersen networks which are constructed by iteratively applying the cartesian product operation on the well-known Petersen graph, provide a very efficient topology for multiprocessors. They have such desirable properties as symmetry, optimal connectivity (and hence maximal fault-tolerance), logarithmic diameter and modularity.
In this paper, we construct multiple arc-disjoint spanning trees on the folded Petersen networks and utilize them for deriving fault-tolerant algorithms for several communication primitives. These problems include single node broadcasting or sending the same message from one node to all others in the network, gossiping or multinode broadcasting, scattering or the problem of sending distinct messages from a single node to each of the other nodes, and total exchange in which single node scattering takes places simultaneously from all nodes.
All of these communication problems are studied on the folded Petersen networks under the all-port communication assumption with bidirectional links.
Key wordsarc-disjoint spanning trees communication fault-tolerance folded Petersen graph interconnection network
Unable to display preview. Download preview PDF.
- [BÖS+91]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.Google Scholar
- [CW85]G. Chartrand and R.J. Wilson. The Petersen graph. Graphs and Applications (Eds. F. Harary and J.S. Maybee), pages 69–100, 1985.Google Scholar
- [FA93]P. Fragopoulou and S.G. Akl. Optimal communication algorithms on the star interconnection network. In Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, pages 702–711, December 1993.Google Scholar
- [FH91]P. Fraigniaud and C.T. Ho. Arc disjoint spanning trees on cube connected cycles network. In Proceedings of the International Conference on Parallel Processing, St. Charles, vol. I, pages 225–229, 1991.Google Scholar
- [GP93]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.Google Scholar
- [JH89]S.L. Johnsson and C.-T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Transaction on Computers, 38(9):1249–1268, September 1989.Google Scholar
- [Lei92]F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, 1992.Google Scholar
- [ÖD93a]S. Öhring and S.K. Das. The folded Petersen cube networks: New competitors for the hypercube. In Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Computing, Dallas, TX, pages 582–589, December 1993.Google Scholar
- [ÖD94]S. Öhring and S.K. Das. Efficient Communication on the Folded Petersen Interconnection Networks. In Proceedings of Parallel Architectures and Languages Europe 1994, Athens, Greece, to appear in Lecture Notes in Computer Science, July 1994.Google Scholar
- [ÖH94]S. Öhring and D.H. Hohndel. Optimal fault tolerant communication algorithms on product networks using spanning trees. Tech. Report CRPDC-94-11, University of North Texas, June 1994.Google Scholar
- [ÖHD94]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.Google Scholar