Patrick C. Fischer
ABSTRACT
In order to minimize the number of page fetches required when multiplying matrices occupying many pages of virtual storage, we consider adapting Strassen-like recursive methods to a paging environment. An algorithm with a theoretically better rate of growth results. Also presented is an algorithm for efficiently converting matrices from row storage form to sub-matrix storage form, thus making more accessible the benefits of algorithms based on sub-matrix storage form which were presented in [5].
- 1.J. L. Elshoff, Some programming techniques for processing multi-dimensional matrices in a paging environment, Research Publication GMR-1483, General Motors Research Laboratories, Warren, Mich., October 1973.Google Scholar
- 2.P. C. Fischer, Further schemes for combining matrix algorithms, in Automata, Languages and Programming-2nd Colloquium, ed. J. Loeckx, Springer-Verlag, Berlin-Heidelberg, 1974, 428-436. Google ScholarDigital Library
- 3.P. C. Fischer and R. L. Probert, Efficient procedures for using matrix algorithms, ibid., 413-427. Google ScholarDigital Library
- 4.R. W. Floyd, Permuting information in idealized two-level storage, in Complexity of Computer Computations, ed. R. E. Miller and J. W. Thatcher, Plenum Press, New York-London, 1972, 105-109.Google Scholar
- 5.A. C. McKellar and E. G. Coffman, Jr., Organizing matrices and matrix operations for paged memory systems, Communications of the ACM, Vol. 12, No. 3, March 1969, 153-165. Google ScholarDigital Library
- 6.C. B. Moler, Matrix computations with Fortran and paging, Communications of the ACM, Vol. 15, No. 4, April 1972, 268-270. Google ScholarDigital Library
- 7.R. L. Probert, On the additive complexity of matrix multiplication, SIAM J. on Computing, Vol. 5, No. 2, June 1976, 187-203.Google ScholarCross Ref
- 8.A. C. Shaw, The Logical Design of Operating Systems, Prentice-Hall, Englewood Cliffs, N. J., 1974. Google ScholarDigital Library
- 9.V. Strassen, Gaussian elimination is not optimal, Numerische Mathematik, Vol. 13, 1969, 354-356.Google ScholarDigital Library
Index Terms
- A note on matrix multiplication in a paging environment
Recommendations
Generalized matrix inversion is not harder than matrix multiplication
Starting from the Strassen method for rapid matrix multiplication and inversion as well as from the recursive Cholesky factorization algorithm, we introduced a completely block recursive algorithm for generalized Cholesky factorization of a given ...
Fast sparse matrix multiplication
Let A and B two n×n matrices over a ring R (e.g., the reals or the integers) each containing at most m nonzero elements. We present a new algorithm that multiplies A and B using O(m0.7n1.2+n2+o(1)) algebraic operations (i.e., multiplications, additions ...
A note on computing matrix-vector products with generalized centrosymmetric (centrohermitian) matrices
To reduce the costs of computing matrix-vector product Ax related to a centrosymmetric matrix A as compared to the case of an arbitrary matrix A, two algorithms were proposed recently, one was designed by Melman [A. Melman, Symmetric centrosymmetric ...
Comments