Memory access pattern: Difference between revisions

Revision as of 16:08, 13 June 2016

Revision as of 16:23, 13 June 2016

Line 1:

{{Multiple issues|

{{Notability|date=June 2016}}

}}

In [[computing]], a '''memory access pattern''' is the pattern with which a system or program reads and writes [[Memory (computing)|memory]]. These patterns differ in the level of [[locality of reference]] and drastically affect [[Cache (computing)|cache]] performance,<ref>{{cite web|title = data oriented design|url=http://www.dice.se/wp-content/uploads/2014/12/Introduction_to_Data-Oriented_Design.pdf}}</ref> and also have implications for the approach to [[parallelism (computing)|parallelism]] and distribution of workload in shared memory systems.

Line 9 ⟶ 7:

Computer memory is usually described as '[[random access memory|random access]]', but traversals by software will still exhibit patterns that can be exploited for efficiency.

Memory access patterns also have implications for security<ref>{{cite web|title=Memory Access Pattern Protection for Resource-constrained Devices|url=https://www.cardis.org/proceedings/cardis_2012/CARDIS2012_14.pdf}}</ref>,which motivates some to try and disguise a programs activity for privacy reasons<ref>{{cite web|title=protecting data in the cloud|url=http://news.mit.edu/2013/protecting-data-in-the-cloud-0702}}</ref>.

== Examples ==

=== Sequential ===