Issue No.06 - June (1989 vol.38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.24305
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
paging performance; block storage; memory systems; data structures; performance; page faults; array access strategies; buffer storage; performance evaluation; storage allocation.
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