research-article

Parallel Matrix Computations Using a Reconfigurable Pipelined Optical Bus

Authors:

Si Qing ZhengAuthors Info & Claims

Journal of Parallel and Distributed Computing, Volume 59, Issue 1

Pages 13 - 30

https://doi.org/10.1006/jpdc.1999.1569

Published: 01 October 1999 Publication History

Abstract

We present fast and cost-efficient parallel algorithms for a number of important and fundamental matrix computation problems on linear arrays with reconfigurable pipelined optical bus systems. These problems include computing the inverse, the characteristic polynomial, the determinant, the rank, the Nth power, and an LU- and a QR-factorization of a matrix and solving linear systems of equations. Our algorithms provide a wide range of performance cost combinations. Compared with known results, the running time of parallel solutions to all these problems can be reduced by a factor of O(logN) while costs are maintained under o(N4).

References

[1]

A.F. Benner, H.F. Jordan, V.P. Heuring, Digital optical computing with optically switched directional couplers, Opt. Engrg., 30 (1991) 1936-1941.

[2]

D. Chiarulli, R. Melhem, S. Levitan, Using coincident optical pulses for parallel memory addressing, IEEE Comput., 30 (1987) 48-57.

Digital Library

[3]

S.A. Cook, A taxonomy of problems with fast parallel algorithms, Inform. and Control, 64 (1985) 2-22.

Digital Library

[4]

D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput., 9 (1990) 251-280.

Digital Library

[5]

L. Csanky, Fast parallel matrix inversion algorithms, SIAM J. Comput., 5 (1976) 618-623.

Digital Library

[6]

Z. Guo, R. Melhem, R. Hall, D. Chiarulli, S. Levitan, Pipelined communications in optically interconnected arrays, J. Parallel Distrib. Comput., 12 (1991) 269-282.

Digital Library

[7]

M. Hamdi, Y. Pan, Efficient parallel algorithms on optically interconnected arrays of processors, 1995.

[8]

O.H. Ibarra, S. Moran, L.E. Rosier, A note on the parallel complexity of computing the rank of order n matrices, Inform. Process. Lett., 11 (1980) 162.

[9]

U.J.J. Le Verrier, Sur les variations seculaires des elementes elliptiques des sept planets principales, J. Math. Pures Appl., 5 (1840) 220-254.

[10]

T. Leighton, Morgan Kaufmann, San Mateo, 1992.

[11]

S. Levitan, D. Chiarulli, R. Melhem, Coincident pulse techniques for multiprocessor interconnection structures, Appl. Optics, 29 (1990) 2024-2039.

[12]

K. Li, Constant time boolean matrix multiplication on a linear array with a reconfigurable pipelined bus system, J. Supercomput., 11 (1997) 391-403.

Digital Library

[13]

K. Li, Y. Pan, S.-Q. Zheng, Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system, IEEE Trans. Parallel Distrib. Systems, 9 (1998) 705-720.

Digital Library

[14]

K. Li, Y. Pan, S.-Q. Zheng, Kluwer Academic, Boston, 1998.

[15]

K. Li, Y. Pan, and, S.-Q. Zheng, Efficient deterministic and probabilistic simulations of PRAMs on a linear array with a reconfigurable pipelined bus system, to appear in J. Supercomput.

Digital Library

[16]

Y. Pan, M. Hamdi, Efficient computation of singular value decomposition on arrays with pipelined optical buses, J. Network Comput. Applications, 19 (1996) 235-248.

Digital Library

[17]

Y. Pan, M. Hamdi, K. Li, Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system, Future Generation Comput. Systems, 13 (1998) 501-513.

Digital Library

[18]

Y. Pan, K. Li, Linear array with a reconfigurable pipelined bus system¿concepts and applications, J. Inform. Sci., 106 (1998) 237-258.

Digital Library

[19]

Y. Pan, K. Li, S.-Q. Zheng, Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system, J. Parallel Algorithms Appl., 13 (1998) 1-25.

[20]

V. Pan, Complexity of parallel matrix computations, Theoret. Comput. Sci., 54 (1987) 65-85.

Digital Library

[21]

V. Pan, J. Reif, Efficient parallel solution of linear systems, 1985.

[22]

S. Pavel, S.G. Akl, Matrix operations using arrays with reconfigurable optical buses, J. Parallel Algorithms Applications, 8 (1996) 223-242.

[23]

C. Qiao, R. Melhem, Time-division optical communications in multiprocessor arrays, IEEE Trans. Comput., 42 (1993) 577-590.

Digital Library

[24]

S. Rajasekaran, S. Sahni, Sorting, selection, and routing on the array with reconfigurable optical buses, IEEE Trans. Parallel Distrib. Systems, 8 (1997) 1123-1131.

Digital Library

[25]

V. Strassen, Gaussian elimination is not optimal, Numer. Math., 13 (1969) 354-356.

Digital Library

[26]

C. Tocci, H.J. Caulfield, Artech House, Norwood, 1994.

[27]

S.-Q. Zheng, Y. Li, Pipelined asynchronous time-division multiplexing optical bus, Opt. Engrg., 36 (1997) 3392-3400.

Cited By

Li K(2007)Analysis of Parallel Algorithms for Matrix Chain Product and Matrix Powers on Distributed Memory SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2007.102718:7(865-878)Online publication date: 1-Jul-2007
https://dl.acm.org/doi/10.1109/TPDS.2007.1027
Pan Y(2003)Computing on the restricted LARPBS modelProceedings of the 2003 international conference on Parallel and distributed processing and applications10.5555/1761566.1761571(9-13)Online publication date: 2-Jul-2003
https://dl.acm.org/doi/10.5555/1761566.1761571
Han YPan YShen H(2002)Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical BusIEEE Transactions on Computers10.1109/TC.2002.100915351:6(702-707)Online publication date: 1-Jun-2002
https://dl.acm.org/doi/10.1109/TC.2002.1009153
Show More Cited By

Index Terms

Parallel Matrix Computations Using a Reconfigurable Pipelined Optical Bus
1. Computing methodologies
  1. Parallel computing methodologies
    1. Parallel algorithms
  2. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Linear algebra algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Parallel algorithms
  2. Models of computation
    1. Concurrency
      1. Parallel computing models

Index terms have been assigned to the content through auto-classification.

Recommendations

Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System

The known fast sequential algorithms for multiplying two $N\times N$ matrices (over an arbitrary ring) have time complexity $O(N^\alpha)$, where $2 < \alpha < 3$. The current best value of $\alpha$ is less than 2.3755. We show that, for all $1 \le p \le ...
Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
Special issue: high performance computing systems

We show that the product of two N × N boolean matrices can be calculated in constant time on an LARPBS with O(N3 / log N) processors. All data communications and computations are performed on the bit level. To the best of the author‘s knowledge, this is ...
Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System

We present efficient parallel matrix multiplication algorithms for linear arrays with reconfigurable pipelined bus systems (LARPBS). Such systems are able to support a large volume of parallel communication of various patterns in constant time. An ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Parallel and Distributed Computing

Journal of Parallel and Distributed Computing Volume 59, Issue 1

October 1999

100 pages

ISSN:0743-7315

Issue’s Table of Contents

Copyright © Academic Press.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 October 1999

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 29 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li K(2007)Analysis of Parallel Algorithms for Matrix Chain Product and Matrix Powers on Distributed Memory SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2007.102718:7(865-878)Online publication date: 1-Jul-2007
https://dl.acm.org/doi/10.1109/TPDS.2007.1027
Pan Y(2003)Computing on the restricted LARPBS modelProceedings of the 2003 international conference on Parallel and distributed processing and applications10.5555/1761566.1761571(9-13)Online publication date: 2-Jul-2003
https://dl.acm.org/doi/10.5555/1761566.1761571
Han YPan YShen H(2002)Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical BusIEEE Transactions on Computers10.1109/TC.2002.100915351:6(702-707)Online publication date: 1-Jun-2002
https://dl.acm.org/doi/10.1109/TC.2002.1009153
Li KPan V(2001)Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus SystemIEEE Transactions on Computers10.1109/12.92616450:5(519-525)Online publication date: 1-May-2001
https://dl.acm.org/doi/10.1109/12.926164
Li K(2001)Scalable Parallel Matrix Multiplication on Distributed Memory Parallel ComputersJournal of Parallel and Distributed Computing10.1006/jpdc.2001.176861:12(1709-1731)Online publication date: 1-Dec-2001
https://dl.acm.org/doi/10.1006/jpdc.2001.1768

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents