Exploiting storage redundancy to speed up randomized shared memory simulations
type: Item
instance of: scholarly article
title: Exploiting storage redundancy to speed up randomized shared memory simulations
zbMATH Open document ID: 0877.68004
DOI: 10.1016/0304-3975(96)00032-1
author: Friedhelm Meyer auf der Heide
author: Christian Scheideler
author: V. Stemann
published in: Theoretical Computer Science
publication date: 1997-09-10T00:00:00Z
Mathematics Subject Classification ID: 68M07
zbMATH DE Number: 1059059
zbMATH Keywords: parallel random access machines
zbMATH Keywords: simple access protocol
MaRDI profile type: Publication
full work available at URL: 0304-3975(96)00032-1
OpenAlex ID: W1984164247
cites work: Q3941433
cites work: Fast parallel space allocation, estimation, and integer sorting
cites work: Universal classes of hash functions
cites work: Dynamic Perfect Hashing: Upper and Lower Bounds
cites work: An Optical Simulation of Shared Memory
cites work: A guided tour of Chernoff bounds
cites work: Efficient PRAM simulation on a distributed memory machine
cites work: On contention resolution protocols and associated probabilistic phenomena
cites work: Fast randomized algorithms for distributed edge coloring
cites work: Q3140437
cites work: How to share memory in a distributed system
cites work: Parallelism in Comparison Problems
cites work: Q4385523
description: scientific article; zbMATH DE number 1059059