Parallel hashing

DOI10.1145/48014.350550zbMath0662.68023OpenAlexW2026887746MaRDI QIDQ3813281

Anna R. Karlin, Eli Upfal

Publication date: 1988

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/48014.350550

zbMATH Keywords

randomized algorithmparallel algorithmshared memoryroutingprobabilistic computationnetwork of processorssimulation between modelsfeasible modeldistributed memoriesparallel hashing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)

Related Items (14)

Locality-preserving hash functions for general purpose parallel computation ⋮ FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH ⋮ Simulating shared memory in real time: On the computation power of reconfigurable architectures ⋮ Efficient PRAM simulation on a distributed memory machine ⋮ Implementing shared memory on multi-dimensional meshes and on the fat-tree ⋮ Representing shared data on distributed-memory parallel computers ⋮ Fast rehashing in PRAM emulations ⋮ The complexity of deterministic PRAM simulation on distributed memory machines ⋮ Clocked adversaries for hashing ⋮ Routing multiple paths in hypercubes ⋮ Polynomial hash functions are reliable ⋮ Constructing disjoint paths on expander graphs ⋮ Simulating the CRCW PRAM on reconfigurable networks ⋮ Implementing shared memory on mesh-connected computers and on the fat-tree

This page was built for publication: Parallel hashing