Locality-preserving hash functions for general purpose parallel computation
From MaRDI portal
Publication:1333434
DOI10.1007/BF01185209zbMath0938.68651DBLPjournals/algorithmica/Chin94OpenAlexW2048071540WikidataQ56564883 ScholiaQ56564883MaRDI QIDQ1333434
Publication date: 13 October 1994
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01185209
localityuniversal hashingPRAM simulationsgeneral-purpose parallel computationcommunication latencyblock PRAM
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel numerical computation (65Y05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A caution on universal classes of hash functions
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- How to emulate shared memory
- Communication complexity of PRAMs
- Efficient parallel algorithms can be made robust
- A practical hierarchical model of parallel computation. I: The model
- Permutations on the block PRAM
- Universal classes of hash functions
- Efficient PRAM simulation on a distributed memory machine
- Fast algorithms for bit-serial routing on a hypercube
- How to share memory in a distributed system
- Parallel hashing
- Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
This page was built for publication: Locality-preserving hash functions for general purpose parallel computation