DocumentCode
961077
Title
Determination of Cache´s Capacity and its Matching Storage Hierarchy
Author
Chow, C.K.
Author_Institution
Thomas J. Watson Research Center, IBM Corporation, Yorktown Heights, NY 10598.
Issue
2
fYear
1976
Firstpage
157
Lastpage
164
Abstract
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.
Keywords
Cache memory; Cache storage; Computational modeling; Computer networks; Cost function; Hierarchical systems; Information analysis; Numerical simulation; Predictive models; Random access memory; Cache capacity; geometric programming; minimum access time; miss ratio; model of linear storage hierarchies; optimal number of storage levels; storage hierarchy; storage technology;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1976.5009230
Filename
5009230
Link To Document