Content deleted Content added
Line 37:
=== Nearest neighbour ===
Nearest neighbour memory access patterns appear in simulation, and are related to sequential/strided patterns. An algorithm may traverse a data structure using information from the nearest neighbours of a data element (in one or more dimensions) to perform a calculation. These are common in physics simulations operating on grids.<ref name="PGAS programming"/>. Nearest neighbour can also refer to inter-node communication in a cluster; Physics simulations which rely on such local access patterns can be paralleled and mapped onto a cluster with purely nearest-neighbour communication, which may have advantages for latency and communication bandwidth.
<ref>{{cite web|title=Quantifying Locality In The Memory Access Patterns of HPC Applications|url=http://www.sdsc.edu/~allans/sc05_locality.pdf}}mentions nearest neighbour access patterns in clusters</ref>
=== 2D Spatially coherent ===
| |||