This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer
July 2001 (vol. 50 no. 7)
pp. 635-646

Abstract—We develop algorithms to multiply two vectors, a vector and a matrix, and two matrices on an OTIS-Mesh optoelectronic computer. Two mappings, group row and group submesh [25], of a matrix onto an OTIS-Mesh are considered and the relative merits of each compared. We show that our algorithms to multiply a column and row vector use an optimal number of data moves for both the group row and group submesh mappings, our algorithm to multiply a row vector and a column vector is optimal for the group row mapping, and our algorithm to multiply a matrix by a column vector is optimal for the group row mapping.

[1] L.E. Cannon, "A Cellular Computer to Implement the Kalman Filter Algorithm," PhD thesis, Montana State Univ., 1969.
[2] S.-G. Chen, J.-C. Lee, and C.-C. Li, “New Systolic Arrays for Matrix Multiplication,” Proc. 1994 Int'l Conf. Parallel Processing, pp. II–211-II–215, 1994.
[3] J. Choi, “A New Parallel Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers,” Concurrency, Practice and Experience, vol. 10, no. 8, p. 655, 1998.
[4] J. Choi, J.J. Dongarra, and D.W. Walker, “PUMMA: Parallel Universal Matrix Multiplication Algorithms on Distributed Memory Concurrent Computers,” Concurrency, Practice and Experience, vol. 6, no. 7, pp. 543-570, 1994.
[5] C.-C. Chou, Y.-F. Deng, G. Li, and Y. Wang, “Parallelizing Strassen's Method for Matrix Multiplication on Distributed-Memory MIMD Architectures,” Computers&Math. with Applications, vol. 30, no. 2, p. 49, 1995.
[6] E. Dekel, D. Nassimi, and S. Sahni, “Parallel Matrix and Graph Algorithms,” SIAM J. Computing, vol. 10, no. 4, pp. 657-675, Nov. 1981.
[7] M. Feldman, S. Esener, C. Guest, and S. Lee, “Comparison between Electrical and Free-Space Optical Interconnects Based on Power and Speed Considerations,” Applied Optics, vol. 27, no. 9, pp. 1742-1751, May 1988.
[8] A. Gupta and V. Kumar, “Scalability of Parallel Algorithms for Matrix Multiplication,” Proc. 1993 Int'l Conf. Parallel Processing, pp. III–115-III–123, 1993.
[9] H. Gupta and P. Sadayappan, “Communication-Efficient Matrix Multiplication on Hypercubes,” Parallel Computing, vol. 22, no. 1, p. 75, 1996.
[10] P. Gupta, “An Efficient Matrix Multiplication Algorithm on EREW Model,” Proc. Int'l Conf. Robotics, Vision and Parallel Processing for Industrial Automation (Rovpia '94), pp. 104-108, 1994.
[11] W. Hendrick, O. Kibar, P. Marchand, C. Fan, D.V. Blerkom, F. McCormick, I. Cokgor, M. Hansen, and S. Esener, “Modeling and Optimization of the Optical Transpose Interconnection System,” Optoelectronic Technology Center, Program Review, Cornell Univ., Sept. 1995.
[12] S.L. Johnsson, “Minimizing the Communication Time for Matrix Multiplication on Multiprocessors,” Parallel Computing, vol. 19, no. 11, p. 1235, 1993.
[13] B. Kaagstroem and M. Raennar, “Distributed General Matrix Multiply and Add for a 2D Mesh Processing Networks,” Lecture Notes in Computer Science, vol. 1041, pp. 333-344, 1996.
[14] L. Keqin, P. Yin, and S.-Q. Zheng, “Novel Implementations of Parallel Matrix Multiplication Algorithms Using Optical Buses,” Proc. 1998 Int'l Conf. Parallel and Distributed Processing Techniques and Applications, pp. 1212-1220, 1998.
[15] A. Krishnamoorthy, P. Marchand, F. Kiamilev, and S. Esener, “Grain-Size Considerations for Optoelectronic Multistage Interconnection Networks,” Applied Optics, vol. 31, no. 26, pp. 5480-5507, Sept. 1992.
[16] P.Z. Lee, “Parallel Matrix Multiplication Algorithms on Hypercube Multiprocessors,” Int'l J. High Speed Computing, vol. 7, no. 3, 1995.
[17] K. Li and V.Y. Pan, “Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System,” Proc. 13th Int'l Parallel Processing Symp. and 10th Symp. Parallel and Distributed Processing, pp. 31-35, 1999.
[18] G.C. Marsden, P.J. Marchand, P. Harvey, and S.C. Esener, “Optical Transpose Interconnection System Architectures,” Optics Letters, vol. 18, no. 13, pp. 1083-1085, July 1993.
[19] W.F. McColl and A. Tiskin, “Memory-Efficient Matrix Multiplication in the BSP Model,” Algorithmica, vol. 24, no. 3, p. 287, 1999.
[20] M. Middendorf, H. Schmeck, and G. Turner, “Sparse Matrix Multiplication on a Reconfigurable Mesh,” The Australian Computer J., vol. 27, no. 2, p. 37, 1995.
[21] P.A. Nelson, “Hypercube Matrix Multiplication,” Parallel Computing, vol. 19, no. 7, p. 777, 1993.
[22] J.S. Oliver, “Matrix Multiplication with DNA,” J. Molecular Evolution, vol. 45, no. 2, p. 161, 1997.
[23] A. Osterloh, “Sorting on the OTIS-Mesh,” Proc. 14th Int'l Parallel and Distributed Processing Symp. (IPDPS 2000), pp. 269-274, 2000.
[24] S. Rajasekeran and S. Sahni, “Randomized Routing, Selection, and Sorting on the Otis-Mesh,” IEEE Trans. Parallel And Distributed Systems, vol. 9, no. 9, pp. 833-840, Sept. 1998.
[25] S. Sahni and C.-F. Wang, “BPC Permutations on the OTIS-Mesh Optoelectronic Computer,” Proc. Fourth Int'l Conf. Massively Parallel Processing Using Optical Interconnections (MPPOI '97), pp. 130-135, 1997.
[26] S. Sahni and C.-F. Wang, “BPC Permutations on the OTIS-Hypercube Optoelectronic Computer,” Informatica, vol. 22, pp. 263-269, 1998.
[27] C.A.A. Sanches and S.W. Song, “SIMD Algorithms for Matrix Multiplication on the Hypercube,” Proc. Eighth Int'l Parallel Processing Symp., pp. 492-496, 1994.
[28] J.F. Tasic, M. Zajc, and A. Kosir, “Comparison of Some Parallel Matrix Multiplication Algorithms,” Proc. Eighth Mediterranean Electrotechnical Conf., pp. 155-158, 1996.
[29] J.-C. Tsay and S. Yuan, “Some Combinatorial Aspects of Parallel Algorithm Design for Matrix Multiplication,” IEEE Trans. Computers, vol. 41, no. 3, pp. 355-360, Mar. 1992.
[30] R.A. van de Geijn and J. Watts, “SUMMA: Scalable Universal Matrix Multiplication Algorithm,” Concurrency, Practice and Experience, vol. 9, no. 4, p. 255, 1997.
[31] C.-F. Wang and S. Sahni, “Basic Operations on the OTIS-Mesh Optoelectronic Computer,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 12, pp. 1226-1236, Dec. 1998.
[32] C.-F. Wang and S. Sahni, “Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer,” Proc. Sixth Int'l Conf. Massively Parallel Processing Using Optical Interconnections (MPPOI '99), pp. 131-138, 1999.
[33] C.-F. Wang and S. Sahni, “Image Processing on the OTIS-Mesh Optoelectronic Computer,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 2, pp. 97-109, 2000.
[34] X. Wu, “An Approach to Scalability of Parallel Matrix Multiplication Algorithms,” Lecture Notes in Computer Science, vol. 1276, pp. 492-501, 1997.
[35] F. Zane, P. Marchand, R. Paturi, and S. Esener, “Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS),” Proc. Second Int'l Conf. Massively Parallel Processing Using Optical Interconnections (MPPOI '96), pp. 114-121, 1996.

Index Terms:
Matrix multiplication, OTIS-Mesh, optical interconnect, optoelectronic computer, optimal algorithm.
Citation:
Chih-fang Wang, Sartaj Sahni, "Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer," IEEE Transactions on Computers, vol. 50, no. 7, pp. 635-646, July 2001, doi:10.1109/12.936231
Usage of this product signifies your acceptance of the Terms of Use.