Abstract
The influence of several hash functions on the distribution of a shared address space onto p distributed memory modules is compared by simulations. Both synthetic workloads and address traces of applications are investigated. It turns out that on all workloads linear hash functions, although proven to be asymptotically worse, perform better than theoretically optimal polynomials of degree O(log p). The latter are also worse than hash functions that use boolean matrices. The performance measurements are done by an expected worst case analysis. Thus linear hash functions provide an efficient and easy to implement way to emulate shared memory.
This work was supported by the German Science Foundation (DFG) in SFB 124, TP D4, and by the Dutch Science Foundation (NWO) through NFI Project ALADDIN under Contract number NF 62-376. Part of this work was done while the second author was working at Universität des Saarlandes, Computer Science Department, Saarbrücken, Germany.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abolhassan, F., Drefenstedt, R., Keller, J., Paul, W. J., Scheerer, D.: On the Physical Design of PRAMs. Informatik — Festschrift zum 60. Geburtstag von Günter Hotz (Teubner, 1992) 1–19
Abolhassan, F., Keller, J., Paul, W. J.: On the cost-effectiveness of PRAMs. Proc. 3rd IEEE Symp. on Parallel and Distributed Processing (1991) 2–9
Akl, S. G.: The Design and Analysis of Parallel Algorithms. (Prentice-Hall, 1989)
Dietzfelbinger, M.: On limitations of the performance of universal hashing with linear functions. Reihe Informatik Bericht Nr. 84 Universität-GH Paderborn (1991)
Dietzfelbinger, M., Hagerup, T., Katajainen, J., Penttonen, M.: A reliable randomized algorithm for the closest-pair problem. Manuscript (1992)
Karlin, A. R., Upfal, E.: Parallel hashing: An efficient implementation of shared memory. J. Assoc. Comput. Mach. 35 (1988) 876–892
Karp, R. M., Ramachandran, V. L.: A survey of parallel algorithms for shared-memory machines. Handbook of Theoretical Computer Science Vol. A (Elsevier, 1990) 869–941
Mehlhorn, K., Vishkin, U.: Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Inform. 21 (1984) 339–374
Norton, A., Melton, E.: A class of boolean linear transformations for conflict-free power-of-two stride access. Proc. Internat. Conf. on Parallel Processing (1987) 247–254
Ranade, A. G.: How to emulate shared memory. Proc. 28th IEEE Symp. on Foundations of Computer Science (1987) 185–194
Shiloach, Y., Vishkin, U.: An O(log n) parallel connectivity algorithm. J. Algorithms 3 (1982) 57–67
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelmann, C., Keller, J. (1993). Simulation-based comparison of hash functions for emulated shared memory. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_1
Download citation
DOI: https://doi.org/10.1007/3-540-56891-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56891-9
Online ISBN: 978-3-540-47779-2
eBook Packages: Springer Book Archive