This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network
July 2000 (vol. 11 no. 7)
pp. 720-728

Abstract—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] P. Berthomé and A. Ferreira, “Improved Embeddings in POPS Networks through Stack-Graph Models,” Proc. Third Int'l Workshop on Massively Parallel Processing Using Optical Interconnections, pp. 130-135, 1996.
[2] D. Chiarulli, S. Levitan, R. Melhem, J. Teza, and G. Gravenstreter, "Multiprocessor Interconnection Networks Using Partitioned Optical Passive Star (POPS) Topologies and Distributed Control," Proc. First Int'l Workshop Massively Parallel Processing UsingOptical Interconnections, pp. 70-80, Apr. 1994.
[3] D. Coudert, A. Ferreira, and X. Muñoz, “Multiprocesor Architectures Using Multi-hop Multi-ops Lightwave Networks and Distributed Control,” Proc. 12th Int'l Parallel Processing Symp. and 9th Symp. on Parallel and Distributed Processing, pp. 151-155, 1998.
[4] E. Dekel, D. Nassimi, and S. Sahni, “Parallel Matrix and Graph Algorithms,” SIAM J. on Computing, vol. 10, no. 4, pp. 657-675, 1981.
[5] G. Gravenstreter, R. Melhem, D. Chiarulli, S. Levitan, and J. Teza, "The Partitioned Optical Passive Stars (POPS) Topology," Proc. Ninth IEEE Int'l Parallel Processing Symp., Apr. 1995.
[6] G. Graventreter and R. Melhem, “Realizing Common Communication Patterns in Partitioned Optical Passive Star (POPS) Networks,” EEE Trans. Computers, pp. 998-1,013, 1998.
[7] J. Lenfant, “Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations,” IEEE Trans. Computers, vol. 27, no. 7, pp. 637-647, 1978.
[8] R. Melhem, G. Graventreter, D. Chiarulli, and S. Levitan, “The Communication Capabilities of Partitioned Optical Passive Star Networks,” Parallel Computing Using Optical Interconnections, K. Li, Y. Pan, and S. Zheng, eds. Kluwer Academic Publishers, pp. 77-98, 1998.
[9] D. Nassimi and S. Sahni,“An optimal routing algorithm for mesh-connected parallel computers,”J. ACM, pp. 6–29, 1980.

Index Terms:
Partitioned optical passive stars network, matrix multiplication, data routing, BPC permutations.
Citation:
Sartaj Sahni, "Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 7, pp. 720-728, July 2000, doi:10.1109/71.877830
Usage of this product signifies your acceptance of the Terms of Use.