Matrix computations with Fortran and paging
- 1 April 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 15 (4) , 268-270
- https://doi.org/10.1145/361284.361297
Abstract
The efficiency of conventional Fortran programs for matrix computations can often be improved by reversing the order of nested loops. Such modifications produce modest savings in many common situations and very significant savings for large problems run under an operating system which uses paging.Keywords
This publication has 5 references indexed in Scilit:
- Matrix computations with Fortran and pagingCommunications of the ACM, 1972
- Organizing matrices and matrix operations for paged memory systemsCommunications of the ACM, 1969
- Dynamic storage allocation systemsCommunications of the ACM, 1968
- Program and Addressing Structure in a Time-Sharing EnvironmentJournal of the ACM, 1966
- FORTRAN vs. Basic FORTRANCommunications of the ACM, 1964