Program and Addressing Structure in a Time-Sharing Environment
Journal of the ACM (JACM)
Organizing matrices and matrix operations for paged memory systems
Communications of the ACM
Dynamic storage allocation systems
Communications of the ACM
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Array Access Bounds for Block Storage Memory Systems
IEEE Transactions on Computers
Space and Time Hierarchies for Classes of Control Structures and Data Structures
Journal of the ACM (JACM)
ACM Transactions on Mathematical Software (TOMS)
Portability of Mathematical Software Coded in Fortran
ACM Transactions on Mathematical Software (TOMS)
Algorithm 576: A FORTRAN Program for Solving Ax=b[F4]
ACM Transactions on Mathematical Software (TOMS)
Solving Large Full Sets of Linear Equations in a Paged Virtual Store
ACM Transactions on Mathematical Software (TOMS)
Relational Data-Base Management Systems
ACM Computing Surveys (CSUR)
CODASYL Data-Base Management Systems
ACM Computing Surveys (CSUR)
Storage reorganization techniques for matrix computation in a paging environment
Communications of the ACM
Algorithm 422: minimal spanning tree [H]
Communications of the ACM
Paging as a "language processing" task
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A note on matrix multiplication in a paging environment
ACM '76 Proceedings of the 1976 annual conference
Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software
Mathematical software patterns
ACM SIGNUM Newsletter
On the Paging Performance of Array Algorithms
IEEE Transactions on Computers
Some programming techniques for processing multi-dimensional matrices in a paging environment
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Solution of the complete symmetric eigenproblem in a virtual memory environment
IBM Journal of Research and Development
| Hi-index | 48.26 |
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.