How caches work
Memory hierarchy: caches
Article REF: H1002 V1
How caches work
Memory hierarchy: caches

Authors : Daniel ETIEMBLE, François ANCEAU

Publication date: August 10, 2012, Review date: March 8, 2022 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

2. How caches work

2.1 Principle of locality

The use of such a memory hierarchy is based on the non-uniform nature of instruction and data accesses in most computer programs, sometimes summarized as the 10%-90% rule: a minority of instructions execute for the majority of the time, and the majority of instructions account for only a small proportion of execution time. This non-uniformity of memory accesses is also known as the principle of locality, which manifests itself in two ways.

– The first aspect is spatial: when a memory reference intervenes, there's a good chance that the next memory reference will be for a neighboring address. Instructions are sequenced between branches. There are program-specific zones in which to place data. In addition, elements of one-dimensional...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?


Article included in this offer

"Software technologies and System architectures"

( 227 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details