Contention Resolution in Hashing Based Shared Memory Simulations

DOI10.1137/S009753979529564XMaRDI QIDQ4943890zbMATH OpenOpenAlexFDO

Authors Friedhelm Meyer auf der Heide, Artur Czumaj, V. Stemann

Publication date 19 March 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s009753979529564x

zbMATH Keywords

distributed memory machinehashingPRAMrandomized shared memory simulations

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Efficient PRAM simulation on a distributed memory machine
• scientific article; zbMATH DE number 2102780
• Shared memory simulations with triple-logarithmic delay
• Exploiting storage redundancy to speed up randomized shared memory simulations
• scientific article; zbMATH DE number 1337740

Cited in

(12)

• Exploiting storage redundancy to speed up randomized shared memory simulations
• Simulating shared memory in real time: On the computation power of reconfigurable architectures
• Efficient PRAM simulation on a distributed memory machine
• Balanced allocation and dictionaries with tightly packed constant size bins
• Revisiting Randomized Parallel Load Balancing Algorithms
• Contention in shared memory algorithms
• Revisiting randomized parallel load balancing algorithms
• scientific article; zbMATH DE number 1543296 (Why is no real title available?)
• Parallel randomized load balancing: a lower bound for a more general model
• A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES
• On contention resolution protocols and associated probabilistic phenomena
• Shared memory simulations with triple-logarithmic delay

This page was built for publication: Contention Resolution in Hashing Based Shared Memory Simulations

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