Memory access pattern: Difference between revisions

Revision as of 14:55, 13 June 2016

Revision as of 15:02, 13 June 2016

Line 22:

=== Random ===

At the opposite extreme is a truly random memory access pattern. A few multiprocessor systems are specialised to deal with these.
<ref>{{cite web||title=Cray and HPCC:
Benchmark Developments and Results from the Past Year (see global random access results for Cray X1)|url=https://cug.org/5-publications/proceedings_attendee_lists/2005CD/S05_Proceedings/pages/Authors/Wichmann/Wichmann_paper.pdf}}</ref>
The [[Partitioned global address space|PGAS]] approach may help by sorting operations by data on the fly (useful when the problem *is* figuring out the locality of unsorted data).<ref>{{cite web|title=partitioned global address space programming|url=https://www.youtube.com/watch?v=NU4VfjISk2M}}</ref>

Data structures which rely heavily on [[pointer chasing]] can often produce poor locality of reference, although sorting can sometimes help.