Remote memory references at block granularity

DOI10.4230/LIPICS.OPODIS.2017.18MaRDI QIDQ3300819zbMATH OpenFDO

Authors Hagit Attiya, Gili Yavneh

Publication date 30 July 2020

Full work available at URL https://doi.org/10.4230/LIPICS.OPODIS.2017.18

zbMATH Keywords

cache coherencedistributed shared memoryfalse sharingNP-hardness

Mathematics Subject Classification ID

Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• A complexity separation between the cache-coherent and distributed shared memory models
• The hardness of cache conscious data placement
• The hardness of cache conscious data placement
• Practical constructive schemes for deterministic shared-memory access
• A hierarchical model of data locality

Cites work

• A fast, scalable mutual exclusion algorithm
• Algorithms – ESA 2005
• An \(O(1)\) RMRs leader election algorithm
• Automata, Languages and Programming
• Cache-oblivious priority queue and graph algorithm applications
• External String Sorting: Faster and Cache-Oblivious
• False sharing and spatial locality in multiprocessor caches
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Matching theory
• Oblivious algorithms for multicores and networks of processors
• Shared-memory mutual exclusion: major research trends since 1986
• The Complexity of Renaming
• The hardness of cache conscious data placement
• The hardness of data packing

This page was built for publication: Remote memory references at block granularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300819)