Memory access pattern: Difference between revisions

Revision as of 21:37, 11 June 2016

Revision as of 21:38, 11 June 2016

Line 13:

=== Random ===

At the opposite extreme is a truly random memory access pattern. A few multiprocessor systems are specialised to deal with these. The [[PartionedPartitioned 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).

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