SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Storage reorganization techniques for matrix computation in a paging environment
Communications of the ACM
Matrix computations with Fortran and paging
Communications of the ACM
Organizing matrices and matrix operations for paged memory systems
Communications of the ACM
Hi-index | 14.98 |
Paging performance can be a dominant factor in a program's running time. Many seemingly efficient data structures and algorithms lose orders of magnitude in performance because they generate an excessive number of page faults. This study shows that tradeoffs exist between average row access speed S/sub r/ (which is defined as the number of row elements retrieved divided by the number of blocks accessed) and average column access speed S/sub c/ (defined similarly). The authors prove that the S/sub r/S/sub c/ product is optimally bounded by the block size N and generalize to other access patterns. Practical array access strategies are developed, and extensions to these results are discussed.