Memory access pattern: Difference between revisions

Revision as of 08:22, 13 June 2016

Revision as of 14:34, 13 June 2016

Line 4:

}}

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]] and distribution of workload in shared memory systems.
<ref>{{cite web|title=gpgpu scatter vs gather|url=http://http.developer.nvidia.com/GPUGems2/gpugems2_chapter31.html}}</ref>
Computer memory is usually described as 'random access', but traversals by software will still exhibit patterns that can be exploited for efficiency.

== Examples ==