论文信息 - Matrix computations with Fortran and paging

Matrix computations with Fortran and paging

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.

Cleve B. Moler | C. Moler

[1] G. Forsythe,et al. Computer solution of linear algebraic systems , 1969 .

[2] Bernard A. Galler,et al. Program and Addressing Structure in a Time-Sharing Environment , 1966, JACM.

[3] Edward G. Coffman,et al. Organizing matrices and matrix operations for paged memory systems , 1969, Commun. ACM.

[4] Cleve B. Moler. Linear Equation Solver [F4] (Algorithm 423) , 1972, Commun. ACM.

[5] Brian Randell,et al. Dynamic storage allocation systems , 1967, SOSP 1967.

[6] G. Forsythe,et al. Computer solution of linear algebraic systems , 1969 .

[7] S. Gorn,et al. FORTRAN vs. Basic FORTRAN: a programming language for informational processing on automatic data processing systems , 1964, CACM.