About: Power law of cache misses

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Power law of cache misses Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/8MTgPG1Nwx

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

Attributes	Values
rdfs:label	Power law of cache misses (en)
rdfs:comment	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 (en)
dct:subject	Computer memory Cache (computing)
Wikipage page ID	52031076 (xsd:integer)
Wikipage revision ID	1105112694 (xsd:integer)
Link from a Wikipage to another Wikipage	Uniprocessor system Cache (computing) Cache hierarchy Cache performance measurement and metric Cache placement policies Stack (abstract data type) CPU cache Computer memory Exponentiation Cache (computing) Working memory Richard Mattson
sameAs	Power law of cache misses Power law of cache misses Power law of cache misses
dbp:wikiPageUsesTemplate	dbt:Reflist
has abstract	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 where M is the miss rate for a cache of size C and M0 is the miss rate of a baseline cache. The exponent α is workload-specific and typically ranges from 0.3 to 0.7. (en)
prov:wasDerivedFrom	wikipedia-en:Power_law_of_cache_misses?oldid=1105112694&ns=0
page length (characters) of wiki page	4053 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Power_law_of_cache_misses
is Link from a Wikipage to another Wikipage of	Power law Cache performance measurement and metric
is foaf:primaryTopic of	wikipedia-en:Power_law_of_cache_misses

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3332 as of Dec 5 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 64 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software