scientific article

DOI10.4230/LIPIcs.OPODIS.2017.18zbMath1487.68029MaRDI QIDQ3300819

Gili Yavneh, Hagit Attiya

Publication date: 30 July 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

distributed shared memoryNP-hardnesscache coherencefalse sharing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Oblivious algorithms for multicores and networks of processors
• Matching theory
• The hardness of data packing
• Cache-oblivious priority queue and graph algorithm applications
• False sharing and spatial locality in multiprocessor caches
• A fast, scalable mutual exclusion algorithm
• Shared-memory mutual exclusion: major research trends since 1986
• The hardness of cache conscious data placement
• An $O(1)$ RMRs Leader Election Algorithm
• External String Sorting: Faster and Cache-Oblivious
• Algorithms – ESA 2005
• The Complexity of Renaming
• Automata, Languages and Programming