A note on matrix multiplication in a paging environment

Authors:
Patrick C. Fischer;Robert L. Probert
Affiliations:
-;Department of Computational Science, University of Saskatchewan, Saskatoon, Sask. STN 0W0, CANADA
Venue:
ACM '76 Proceedings of the 1976 annual conference
Year:
1976

Citing 5
Cited 1

Matrix computations with Fortran and paging

Communications of the ACM
Organizing matrices and matrix operations for paged memory systems

Communications of the ACM
The Logical Design of Operating Systems

The Logical Design of Operating Systems
Efficient Procedures for Using Matrix Algorithms

Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Further Schemes for Combining Matrix Algorithms

Proceedings of the 2nd Colloquium on Automata, Languages and Programming

Storage reorganization techniques for matrix computation in a paging environment

Communications of the ACM

Quantified Score

Hi-index	0.02

Visualization

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].