Power law of cache misses
A power law is a mathematical relationship between two quantities in which one is directly proportional to some power of the other. The power law for cache misses was first established by C. K. Chow in his 1974 paper, supported by experimental data on hit ratios for stack processing by Richard Mattson in 1971. The power law of cache misses can be used to narrow down the cache sizes to practical ranges, given a tolerable miss rate, as one of the early steps while designing the cache hierarchy for a uniprocessor system. The power law for cache misses can be stated as
Link from a Wikipage to another Wikipage
primaryTopic
Power law of cache misses
A power law is a mathematical relationship between two quantities in which one is directly proportional to some power of the other. The power law for cache misses was first established by C. K. Chow in his 1974 paper, supported by experimental data on hit ratios for stack processing by Richard Mattson in 1971. The power law of cache misses can be used to narrow down the cache sizes to practical ranges, given a tolerable miss rate, as one of the early steps while designing the cache hierarchy for a uniprocessor system. The power law for cache misses can be stated as
has abstract
A power law is a mathematical ...... ically ranges from 0.3 to 0.7.
@en
Wikipage page ID
52,031,076
page length (characters) of wiki page
Wikipage revision ID
1,025,781,566
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
A power law is a mathematical ...... cache misses can be stated as
@en
label
Power law of cache misses
@en