Cart (Loading....) | Create Account
Close category search window
 

Determination of Cache's Capacity and its Matching Storage Hierarchy

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

1 Author(s)
Chow, C.K. ; Thomas J. Watson Research Center, IBM Corporation, Yorktown Heights, NY 10598.

The optimum capacity of a cache memory with given access time is determined analytically based upon a model of linear storage hierarchies wherein both the hit ratio function and the device technology-cost function are assumed to be power functions. Explicit formulas for the capacities and access times of the storage levels in the matching hierarchy of required capacity and allowable cost are derived. The optimal number of storage levels in a hierarchy is shown to increase linearly with the logarithm of the ratio of the required hierarchy capacity and the cache capacity.

Published in:

Computers, IEEE Transactions on  (Volume:C-25 ,  Issue: 2 )

Date of Publication:

Feb. 1976

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.