Simulation-based Comparison of Hash Functions for Emulated Shared Memory
暂无分享,去创建一个
[1] Wolfgang J. Paul,et al. On the Physical Design of PRAMs , 1992, Comput. J..
[2] Wolfgang J. Paul,et al. On the cost–effectiveness of PRAMs , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.
[3] Uzi Vishkin,et al. An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.
[4] Richard M. Karp,et al. A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .
[5] Selim G. Akl,et al. Design and analysis of parallel algorithms , 1985 .
[6] Alan Norton,et al. A Class of Boolean Linear Transformations for Conflict-Free Power-of-Two Stride Access , 1987, ICPP.
[7] VishkinUzi,et al. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories , 1984 .
[8] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[9] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[10] Abhiram G. Ranade,et al. How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[11] Eli Upfal,et al. Parallel hashing: an efficient implementation of shared memory , 1988, JACM.