Locality-preserving hash functions for general purpose parallel computation
@article{Chin2005LocalitypreservingHF, title={Locality-preserving hash functions for general purpose parallel computation}, author={A. Chin}, journal={Algorithmica}, year={2005}, volume={12}, pages={170-181} }
Consider the problem of efficiently simulating the shared-memory parallel random access machine (PRAM) model on massively parallel architectures with physically distributed memory. To prevent network congestion and memory bank contention, it may be advantageous to hash the shared memory address space. The decision on whether or not to use hashing depends on (1) the communication latency in the network and (2) the locality of memory accesses in the algorithm.We relate this decision directly to… Expand
Topics from this paper
11 Citations
Uniform Hashing in Constant Time and Optimal Space
- Computer Science, Mathematics
- SIAM J. Comput.
- 2008
- 69
- PDF
ConCORD: Tracking and Exploiting Cross-Node Memory Content Redundancy in Large-Scale Parallel Systems
- Computer Science
- 2013
- 1
- PDF
Multi-level indexing in a distributed self-organized storage system
- Computer Science
- 2011 IEEE Congress of Evolutionary Computation (CEC)
- 2011
- 11
- PDF
Hierarchy-aware ECC model for Cloud
- Computer Science
- 2010 2nd International Conference on Industrial and Information Systems
- 2010
- 9
Impact of Metadata Server on a Large Scale File System
- Computer Science
- 2018 IEEE Colombian Conference on Communications and Computing (COLCOM)
- 2018
- 1
A Survey on Large Scale Metadata Server for Big Data Storage
- Computer Science
- ArXiv
- 2020
- Highly Influenced
- PDF
Locally distributed spatial navigation in a scale-space model for grid cells
- Computer Science
- 2018
- 1
- PDF
References
SHOWING 1-10 OF 59 REFERENCES
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- Computer Science
- Acta Informatica
- 2004
- 82
How to emulate shared memory
- Computer Science, Mathematics
- 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
- 1987
- 363
On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications
- Mathematics, Computer Science
- 30th Annual Symposium on Foundations of Computer Science
- 1989
- 117
- PDF
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
- Computer Science
- SIAM J. Comput.
- 1992
- 67
General Purpose Parallel Architectures
- Computer Science
- Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
- 1990
- 432