Parallel hashing

DOI10.1145/48014.350550MaRDI QIDQ3813281zbMATH OpenOpenAlexFDO

Authors 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

parallel algorithmrandomized algorithmroutingshared memoryprobabilistic 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)

Recommendations

• Simple Fast Parallel Hashing by Oblivious Execution
• How to share memory in a distributed system
• Exploiting storage redundancy to speed up randomized shared memory simulations
• Analysis of parallel uniform hashing
• ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING

Cited in

(20)

• Implementing shared memory on mesh-connected computers and on the fat-tree
• Clocked adversaries for hashing
• Parallel Hashing via List Recoverability
• Simulating the CRCW PRAM on reconfigurable networks
• Paradeisos: a perfect hashing algorithm for many-body eigenvalue problems
• Simple fast parallel hashing
• Polynomial hash functions are reliable (extended abstract)
• FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH
• PARALLEL SORT-HASH OBJECT-ORIENTED COLLECTION JOIN ALGORITHMS FOR SHARED-MEMORY MACHINES
• Routing multiple paths in hypercubes
• Efficient PRAM simulation on a distributed memory machine
• Implementing shared memory on multi-dimensional meshes and on the fat-tree
• On parallel hashing and integer sorting
• Constructing disjoint paths on expander graphs
• Representing shared data on distributed-memory parallel computers
• ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING
• Locality-preserving hash functions for general purpose parallel computation
• Simulating shared memory in real time: On the computation power of reconfigurable architectures
• Fast rehashing in PRAM emulations
• The complexity of deterministic PRAM simulation on distributed memory machines

This page was built for publication: Parallel hashing

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