Locality-preserving hash functions for general purpose parallel computation

DOI10.1007/BF01185209MaRDI QIDQ1333434zbMATH OpenOpenAlexDBLPWikidataFDO

Authors V. Pereyra

Publication date 13 October 1994

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01185209

zbMATH Keywords

block PRAMcommunication latencygeneral-purpose parallel computationlocalityPRAM simulationsuniversal hashing

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites work

• A caution on universal classes of hash functions
• A practical hierarchical model of parallel computation. I: The model
• Communication complexity of PRAMs
• Efficient parallel algorithms can be made robust
• Efficient PRAM simulation on a distributed memory machine
• Fast algorithms for bit-serial routing on a hypercube
• How to emulate shared memory
• How to share memory in a distributed system
• scientific article; zbMATH DE number 426330 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• Parallel hashing
• Permutations on the block PRAM
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• Universal classes of hash functions
• Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers

Cited in

(1)

• Permutations on the block PRAM

This page was built for publication: Locality-preserving hash functions for general purpose parallel computation

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