This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Information Dissemination in Star and Pancake Networks
December 1996 (vol. 7 no. 12)
pp. 1292-1300

Abstract—This paper presents a new decomposition technique for hierarchical Cayley graphs. This technique yields a very easy implementation of the divide and conquer paradigm for some problems on very complex architectures as the star graph or the pancake. As applications, we introduce algorithms for broadcasting and prefix-like operations that improve the best known bounds for these problems. We also give the first nontrivial optimal gossiping algorithms for these networks. In star-graphs and pancakes with N = n! processors, our algorithms take less than $\lceil {\rm log}\ N\rceil + 1.5n$ steps.

[1] A. Ferreira, "Parallel and Communication Algorithms on Hypercube Multiprocessors," Parallel and Distributed Computing Handbook, A. Zomaya, ed., chapter 19. McGraw-Hill, 1995.
[2] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[3] C. GowriSankaran, "Broadcasting on Recursively Decomposable Cayley Graphs," Discrete Applied Mathematics, vol. 53, pp. 171-182, Sept. 1994.
[4] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[5] S.G. Akl, K. Qiu, and I. Stojmenovic, "Data Communication and Computational Geometry on the Star and Pancake Interconnection Networks," Proc. Third IEEE Symp. Parallel and Distributed Systems, pp. 415-422,Dallas, Dec. 1991.
[6] V.E. Mendia and D. Sarkar, “Optimal Broadcasting in the Star Graph,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 389-396, July 1992.
[7] P. Berthomé, A. Ferreira, and S. Perennes, "Optimal Information Dissemination in Star and Pancake Networks," Proc. Fifth IEEE Symp. Parallel and Distributed Processing, pp. 720-724, Dec. 1993.
[8] P. Fraigniaud and E. Lazard, "Methods and Problems of Communication in Usual Networks," Discrete Applied Math., vol. 53, pp. 79-133, 1994.
[9] S. Hedetniemi, S. Hedetniemi, and A. Liestman, "A Survey of Gossiping and Broadcasting in Communication Networks," Networks, vol. 18, pp. 319-349, 1988.
[10] S. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the n-Cube," Proc. Int'l Conf. Parallel Processing, pp. 393-400, 1987.

Index Terms:
Interconnection networks, parallel computing, parallel architectures, communication algorithms, star graph, pancake graph, Cayley graphs, broadcast, gossip, parallel prefix.
Citation:
Pascal Berthomé, Afonso Ferreira, Stéphane Perennes, "Optimal Information Dissemination in Star and Pancake Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 12, pp. 1292-1300, Dec. 1996, doi:10.1109/71.553290
Usage of this product signifies your acceptance of the Terms of Use.