By Topic

Array access bounds for block storage memory systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Park, A. ; Div. of Comput. Sci., California Univ., Davis, CA, USA ; Balasubramanian, K. ; Lipton, R.J.

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 Sr (which is defined as the number of row elements retrieved divided by the number of blocks accessed) and average column access speed Sc (defined similarly). The authors prove that the Sr Sc 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

Published in:

Computers, IEEE Transactions on  (Volume:38 ,  Issue: 6 )