Advertisement

Fast Matrix Multiplication and Related Operations Using Reconfigurable Optical Buses

  • Keqin Li
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 468)

Abstract

We present efficient parallel matrix multiplication algorithms for linear arrays with reconfigurable pipelined bus systems (LARPBS). The main contributions are as follows. We develop five matrix multiplication algorithms with varying degrees of parallelism on the LARPBS computing model, namely, MM1, MM2, MM3, and compound algorithms C 1(ε) and C 2(δ). Algorithm C 1(ε) has adjustable time complexity in sub-linear level. Algorithm C 2(δ) implies that it is feasible to achieve sub-logarithmic time using o(N 3) processors for matrix multiplication on a realistic system. Algorithms MM3, C 1(ε), and C 2(δ) all have o(N 3) cost, and hence, are very processor efficient. Algorithms MM1, MM3, and C 1(ε) are general-purpose matrix multiplication algorithms, where the array elements are in any ring. Algorithms MM2 and C 2(δ) are applicable to array elements that are integers of bounded magnitude, or floating-point values of bounded precision and magnitude, or boolean values. Extension of algorithms MM2 and C 2(δ) to unbounded integers and reals, as well as the application of our matrix multiplication algorithms in solving a number of important and fundamental matrix computation problems, are also discussed.

Keywords

Matrix Multiplication Linear Array Array Element Optical Interconnection Relate Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974.MATHGoogle Scholar
  2. [2]
    S.G. Akl, Parallel Computation: Models and Methods, Prentice-Hall, Upper Saddle River, New Jersey, 1997.Google Scholar
  3. [3]
    A.F. Benner, H.F. Jordan, and V.P. Heuring, “Digital optical computing with optically switched directional couplers,” Optical Engineering, vol.30, pp.1936–1941, 1991.CrossRefGoogle Scholar
  4. [4]
    D. Bini and V.Y. Pan, Polynomial and Matrix Computations, Vol.1, Fundamental Algorithms, Birkhäuser, Boston, 1994.Google Scholar
  5. [5]
    L.E. Cannon, A Cellular Computer to Implement the Kalman Filter Algorithm, Ph.D. Thesis, Montana State University, Bozman, Montana, 1969.Google Scholar
  6. [6]
    A.K. Chandra, “Maximal parallelism in matrix multiplication,” Report RC-6193, IBM T.J. Watson Research Center, Yorktown Heights, New York, October 1979.Google Scholar
  7. [7]
    D. Chiarulli, R. Melhem, and S. Levitan, “Using coincident optical pulses for parallel memory addressing,” IEEE Computer, vol.30, pp.48–57, 1987.Google Scholar
  8. [8]
    D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,” Journal of Symbolic Computation, vol.9, pp.251–280, 1990.MATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    E. Dekel, D. Nassimi, and S. Sahni, “Parallel matrix and graph algorithms,” SIAM Journal on Computing, vol.10, pp.657–673, 1981.MATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    P.W. Dowd, “Wavelength division multiple access channel hypercube processor interconnection,” IEEE Transactions on Computers, vol.41, pp.1223–1241, 1992.CrossRefGoogle Scholar
  11. [11]
    Z. Guo, “Sorting on array processors with pipelined buses,” Proceedings of International Conference on Parallel Processing, pp.289–292, August 1992.Google Scholar
  12. [12]
    Z. Guo, R. Melhem, R. Hall, D. Chiarulli, and S. Levitan, “Pipelined communications in optically interconnected arrays,” Journal of Parallel and Distributed Computing, vol.12, pp.269–282, 1991.CrossRefGoogle Scholar
  13. [13]
    M. Hamdi and Y. Pan, “Efficient parallel algorithms on optically interconnected arrays of processors,” IEE Proceedings — Computers and Digital Techniques, vol.142, pp.87–92, March 1995.CrossRefGoogle Scholar
  14. [14]
    V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin/Cummings, Redwood City, California, 1994.MATHGoogle Scholar
  15. [15]
    T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes, Morgan Kaufmann, San Mateo, California, 1992.MATHGoogle Scholar
  16. [16]
    S. Levitan, D. Chiarulli, and R. Melhem, “Coincident pulse techniques for multiprocessor interconnection structures,” Applied Optics, vol.29, pp.2024–2039, 1990.CrossRefGoogle Scholar
  17. [17]
    K. Li, “Constant time boolean matrix multiplication on a linear array with a reconfigurable pipelined bus system,” Journal of Supercomputing, vol.11,no.4, pp.391–403, 1997.CrossRefGoogle Scholar
  18. [18]
    K. Li, Y. Pan, and S.-Q. Zheng, “Simulation of parallel random access machines on a linear array with a reconfigurable pipelined bus system,” Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, vol. II, pp.590–599, July 1997.Google Scholar
  19. [19]
    K. Li, Y. Pan, and S.-Q. Zheng, “Fast and efficient parallel matrix computations on a linear array with a reconfigurable pipelined optical bus system,” in High Performance Computing Systems and Applications, J. Schaeffer and R. Unrau, eds., Kluwer Academic Press, 1998.Google Scholar
  20. [20]
    K. Li, Y. Pan, and S.-Q. Zheng, “Scalable parallel matrix multiplication using reconfigurable pipelined optical bus systems,” Proceedings of 10th International Conference on Parallel and Distributed Computing and Systems, October 1998.Google Scholar
  21. [21]
    K. Li, Y. Pan, and S.-Q. Zheng, “Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system,” to appear in IEEE Transactions on Parallel and Distributed Systems.Google Scholar
  22. [22]
    Y. Li, Y. Pan, and S.-Q. Zheng, “Pipelined TDM optical bus with conditional delays,” Optical Engineering, vol.36,no.9, pp.2417–2424, 1997.CrossRefGoogle Scholar
  23. [23]
    Y. Li and S.-Q. Zheng, “Parallel selection on a pipelined TDM optical buses,” Proceedings of International Conference on Parallel and Distributed Computing Systems, pp.69–73, Dijon, France, September 1996.Google Scholar
  24. [24]
    Y. Pan, “Hough transform on arrays with an optical bus,” Proceedings of 5th International conference on Parallel and Distributed Computing and Systems, pp.161–166, October 1992.Google Scholar
  25. [25]
    Y. Pan, “Order statistics on optically interconnected multiprocessor systems,” Proceedings of the 1st International Workshop on Massively Parallel Processing Using Optical Interconnections, pp.162–169, April 1994.Google Scholar
  26. [26]
    Y. Pan and M. Hamdi, “Efficient computation of singular value decomposition on arrays with pipelined optical buses,” Journal of Network and Computer Applications, vol.19, pp.235–248, July 1996.CrossRefGoogle Scholar
  27. [27]
    Y. Pan, M. Hamdi, and K. Li, “Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system,” Future Generation Computer Systems, vol.13,no.6, pp.501–513, 1998.CrossRefGoogle Scholar
  28. [28]
    Y. Pan and K. Li, “Linear array with a reconfigurable pipelined bus system — concepts and applications,” Information Sciences — An International Journal, vol.106,no.3–4, pp.237–258, 1998.Google Scholar
  29. [29]
    Y. Pan, K. Li, and S.-Q. Zheng, “Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system,” to appear in Parallel Algorithms and Applications.Google Scholar
  30. [30]
    V. Pan, “Parallel solution of sparse linear and path systems,” in Synthesis of Parallel Algorithms, J.H. Reif ed., pp.621–678, Morgan Kaufmann, San Mateo, California, 1993.Google Scholar
  31. [31]
    V. Pan and J. Reif, “Efficient parallel solution of linear systems,” Proceedings of 7th ACM Symposium on Theory of Computing, pp.143–152, May 1985.Google Scholar
  32. [32]
    H. Park, H.J. Kim, and V.K. Prasanna, “An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh,” Information Processing Letters, vol.47, pp.109–113, 1993.MATHCrossRefMathSciNetGoogle Scholar
  33. [33]
    S. Pavel, Computation and Communication Aspects of Arrays with Optical Pipelined Buses, Ph.D. Thesis, Dept. of Computing and Information Science, Queen’s University, Ontario, Canada, 1996.Google Scholar
  34. [34]
    S. Pavel and S.G. Akl, “Matrix operations using arrays with reconfigurable optical buses,” Journal of Parallel Algorithms and Applications, vol.8, pp.223–242, 1996.MATHGoogle Scholar
  35. [35]
    S. Pavel and S.G. Akl, “On the power of arrays with reconfigurable optical buses,” Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, vol.III, pp.1443–1454, August 1996.Google Scholar
  36. [36]
    C. Qiao, “Efficient matrix operations in a reconfigurable array with spanning optical buses,” Proceedings of the 5th Symposium on the Frontiers of Parallel Computation, pp. 273–280, 1995.Google Scholar
  37. [37]
    C. Qiao and R. Melhem, “Time-division optical communications in multiprocessor arrays,” IEEE Transactions on Computers, vol.42, pp.577–590, 1993.CrossRefGoogle Scholar
  38. [38]
    S. Rajasekaran and S. Sahni, “Sorting, selection and routing on the array with reconfigurable optical buses,” IEEE Transactions on Parallel and Distributed Systems, vol.8,no.11, pp.1123–1131, 1997.CrossRefGoogle Scholar
  39. [39]
    V. Strassen, “Gaussian elimination is not optimal,” Numerische Mathematik, vol.13, pp. 354–356, 1969.MATHCrossRefMathSciNetGoogle Scholar
  40. [40]
    C. Tocci and H.J. Caulfield, eds., Optical Interconnection — Foundations and Applications, Artech Houce, Inc., 1994.Google Scholar
  41. [41]
    J.L. Trahan, Y. Pan, R. Vaidyanathan, and A.G. Bourgeois, “Scalable basic algorithms on a linear array with a reconfigurable pipelined bus system,” Proceedings of 10th International Conference on Parallel and Distributed Computing Systems, pp. 564–569, October 1997.Google Scholar
  42. [42]
    S.-Q. Zheng and Y. Li, “Pipelined asynchronous time-division multiplexing optical bus,” Optical Engineering, vol.36,no.12, pp.3392–3400, 1997.CrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Keqin Li
    • 1
  1. 1.Department of Mathematics and Computer ScienceState University of New YorkNew Paltz

Personalised recommendations