This Article 
 Bibliographic References 
 Add to: 
Array Access Bounds for Block Storage Memory Systems
June 1989 (vol. 38 no. 6)
pp. 909-913
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

[1] H. Garcia-Molina, A. Park, and L. R. Rogers, "Performance through memory."inProc. 1987 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, May 1987, pp. 122-131.
[2] A.C. McKellar and E.G. Coffman, Jr., "Organizing Matrices and Matrix Operations for Paged Memory Systems,"Comm. ACM, March 1969, pp. 153-165.
[3] P.C. Fischer and R.L. Probert, "Storage Reorganization Techniques for Matrix Computation in a Paging Environment,"Comm. ACM, July 1979, pp. 405-415.
[4] C. B. Moler, "Matrix computations with Fortran and paging,"Commun. ACM, vol. 15, pp. 268-270, Apr. 1972.
[5] P. Budnick and D. J. Kuck, "The organization and use of parallel memories,"IEEE Trans. Comput., vol. C-20, pp. 1566-1569, Dec. 1971.
[6] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
[7] D. H. Lawrie, "The prime memory system for array access,"IEEE Trans. Comput., vol. C-31, pp. 134-141, May 1982.

Index Terms:
paging performance; block storage; memory systems; data structures; performance; page faults; array access strategies; buffer storage; performance evaluation; storage allocation.
A. Park, K. Balasubramanian, R.J. Lipton, "Array Access Bounds for Block Storage Memory Systems," IEEE Transactions on Computers, vol. 38, no. 6, pp. 909-913, June 1989, doi:10.1109/12.24305
Usage of this product signifies your acceptance of the Terms of Use.