Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network

We develop optimal or near optimal algorithms to multiply matrices and perform commonly occurring data permutations and BPC permutations on multiprocessor computers interconnected by a partitioned optical passive stars network.

[1]  David Coudert,et al.  Multiprocessor architectures using multi-hop multi-OPS lightwave networks and distributed control , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[2]  Sartaj Sahni,et al.  An optimal routing algorithm for mesh-connected Parallel computers , 1980, JACM.

[3]  Donald M. Chiarulli,et al.  Multiprocessor interconnection networks using partitioned optical passive star (POPS) topologies and distributed control , 1994, First International Workshop on Massively Parallel Processing Using Optical Interconnections.

[4]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[5]  Rami G. Melhem,et al.  The Partitioned Optical Passive Stars (POPS) topology , 1995, Proceedings of 9th International Parallel Processing Symposium.

[6]  P. Berthome,et al.  Improved embeddings in POPS networks through stack-graph models , 1996, Proceedings of Massively Parallel Processing Using Optical Interconnections.

[7]  Rami Melhem,et al.  The Communication Capabilities of Partitioned Optical Passive Stars Networks , 1998 .

[8]  Jacques Lenfant,et al.  Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations , 1978, IEEE Transactions on Computers.

[9]  Rami G. Melhem,et al.  Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks , 1998, IEEE Trans. Computers.