Abstract
Array processor models in the past have assumed constant storage per processor. Such an assumption leads to a lower bound of Ω(n2) time complexity to multiply two n×n matrices on a one-dimensional array processor.
In this paper it is shown that relaxing the restriction of constant storage per processor leads to a lower bound of Ω(n√n) time complexity to multiply two n×n matrices on a one-dimensional array processor. Furthermore, an optimal matrix multiplication algorithm is described for such an array that uses O(n√n) processors and requires O(n√n) time. The algorithm is well suited for fault-tolerant VLSI implementation.
This material is based on work supported in part by the National Science Foundation under grant number ECS-84-04399, in part by the Office of Naval Research under Contract N00014-84-K-0530 and an IBM faculty development award.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Arjomandi, “A Study of Parallelism in Graph Theory,”Ph.D. Thesis, Department of Computer Science, University of Toronto, (December,1975).
J. Bentley and T. Ottmann, “The Power of One-Dimensional Vector of Processors,” Universitat Karlsruhe, Bericht 89, (April, 1980).
L.E. Cannon, “A Cellular Computer to Implement the Kalman Filter Algorithm,” Ph.D. Thesis, Montana State University, (1969).
A. Chandra, “Maximal Parallelism in Matrix Multiplication,” IBM Tech. Report, RC 6193, (September, 1976).
M. Flynn and S.R. Kosaraju, “Processes and their Interactions,” Kybernetics, 5(1976),pp. 159–163.
W.M. Gentleman, “Some Complexity Results for Matrix Computations on Parallel Processors,” JACM, 25(1978), pp. 112–115.
A.V. Kulkarni and D.W.L. Yen, “Systolic Processing and an Implementation for Signal and Image Processing,” IEEE Transactions on Computers, C-31, No. 10, (October, 1982), pp. 1000–1009.
H.T. Kung and M. Lam, “Wafer-Scale Integration and Two-Level Pipelined Implementation of Systolic Arrays,” Proceedings of the MIT Conference on Advanced Research in VLSI, (January, 1984).
H.T. Kung and C.E. Leiserson, “Systolic Arrays (for VLSI),” Sparse Matrix Proceedings 1978, I.S. Duff and G.W. Stewart (editors), SIAM (1979), pp. 256–282.
C.A. Mead and L. Conway, “Introduction to VLSI Systems,” Addison-Wesley, Reading, Massachusetts, (1980).
I.V. Ramakrishnan, D.S. Fussell and A. Silberschatz, “Systolic Matrix Multiplication on a Linear Array,” Twentieth Annual Allerton Conference on Computing, Control and Communication, (October, 1982).
I.V. Ramakrishnan and P.J. Varman, “Modular Matrix Multiplication on a Linear Array,” IEEE Transactions on Computers, C-33, No. 10, (November, 1984).
A. Rosenberg, “The Diogenes Approach to Testable Fault-Tolerant Networks of Processors,” IEEE Transactions on Computers, C-32, No. 10, (October, 1983).
F. Van Scoy, “Parallel Algorithms in Cellular Spaces,” Ph.D. Thesis, University of Virginia, (1976).
P.J. Varman, “Wafer-Scale Integration of Linear Processor Arrays,” Ph.D. Thesis, The University of Texas at Austin, (August, 1983).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Varman, P.J., Ramakrishnan, I.V. (1985). On matrix multiplication using array processors. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015774
Download citation
DOI: https://doi.org/10.1007/BFb0015774
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive