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}
}
  • A. Chin
  • Published 2005
  • Computer Science
  • Algorithmica
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
11 Citations
Uniform Hashing in Constant Time and Optimal Space
  • 69
  • PDF
ConCORD: Tracking and Exploiting Cross-Node Memory Content Redundancy in Large-Scale Parallel Systems
  • 1
  • PDF
Hashing, randomness and dictionaries
  • 8
  • PDF
Multi-level indexing in a distributed self-organized storage system
  • 11
  • PDF
Hierarchy-aware ECC model for Cloud
  • 9
Impact of Metadata Server on a Large Scale File System
  • 1
A Survey on Large Scale Metadata Server for Big Data Storage
  • Highly Influenced
  • PDF
Locally distributed spatial navigation in a scale-space model for grid cells
  • 1
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 59 REFERENCES
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
  • 82
How to emulate shared memory
  • A. Ranade
  • Computer Science, Mathematics
  • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
  • 363
How to distribute a dictionary in a complete network
  • 40
On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications
  • A. Siegel
  • Mathematics, Computer Science
  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
  • 117
  • PDF
Efficient robust parallel computations
  • 130
General Purpose Parallel Architectures
  • L. Valiant
  • Computer Science
  • Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
  • 1990
  • 432
How to share memory in a distributed system
  • 178
  • PDF
...
1
2
3
4
5
...