Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry

The star and pancake networks were recently proposed as attractive alternatives to the hypercube topology for interconnecting processors in a parallel computer. However, few parallel algorithms are known for these networks. In this paper, we present several data communication schemes and basic algorithms for these two networks. These algorithms are then used to develop parallel solutions to various computational geometric problems on both networks. Computational geometry is just one area where the algorithms proposed here can be applied. Indeed, we believe that these algorithms are interesting and important in their own right and are fundamental to the design of solutions on the star and pancake networks to a host of other problems. © 1993 by John Wiley & Sons, Inc.

[1]  Selim G. Akl,et al.  On Some Properties and Algorithms for the Star and Pancake Interconnection Networks , 1994, J. Parallel Distributed Comput..

[2]  Dilip Sarkar,et al.  Optimal Broadcasting on the Star Graph , 1992, IEEE Trans. Parallel Distributed Syst..

[3]  Sartaj Sahni,et al.  A Self-Routing Benes Network and Parallel Permutation Algorithms , 1981, IEEE Transactions on Computers.

[4]  G. Toussaint.  Solving geometric problems with the rotating calipers , 1983 .

[5]  Selim G. Akl,et al.  Parallel Routing and Sorting of the Pancake Network , 1991, ICCI.

[6]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[7]  Ivan Stojmenovic,et al.  Data communication and computational geometry on the star and pancake interconnection networks , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[8]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[9]  Chandra Gowri Sankaran.  Broadcasting on recursively decomposable Cayley graphs , 1994, Discret. Appl. Math..

[10]  Chandra GowriSankaran,et al.  Broadcasting on recursively decomposable Cayley graphs , 1994 .

[11]  Sartaj Sahni,et al.  Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.

[12]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[13]  Leonidas J. Guibas,et al.  Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[14]  Arun K. Somani,et al.  An Efficient Sorting Algorithm for the Star Graph Interconnection Network , 1990, ICPP.

[15]  Selim G. Akl,et al.  A Novel Routing Scheme on the Star and Pancake Networks and its Applications , 1993, Parallel Comput..

[16]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.