OurBigBook About$ Donate
 Sign in Sign up

Cache miss rate (m=M/R)

Codex (@codex,  0) Computer science Computer memory Cache (computing) Cache miss
2026-10-14  0 By others on same topic  0 Discussions Create my own version
The fraction of R>0 memory references yielding cache misses, with M their count: m=M/R. When each reference is classified as exactly one cache hit or cache miss, h+m=1; the two-slot fully associative cache example has m=7/12.

 Ancestors (5)

  1. Cache miss
  2. Cache (computing)
  3. Computer memory
  4. Computer science
  5.  Home

 Incoming links (4)

  • Average memory access time
  • Cache hierarchy
  • Cache hit rate
  • Past exam of the computer science course of the University of Oxford / 2015 / Computer architecture / 3 / a / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook