Skip to main content
SpringerLink
Log in

High performance universal hashing, with applications to shared memory simulations

  • Parallel and Distributed Algorithms
  • Chapter
  • First Online:
Data structures and efficient algorithms

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 594))

Abstract

We describe and analyze a new high performance universal class of hash functions which can be constructed fast, evaluated in constant time, and which have properties very similar to the “ideal” hash function, namely a random function. We illustrate the capabilities of the new class by considering simple perfect hashing schemes.

We further survey recent results in a very important application area of the new hash functions, namely results on simulations of parallel shared memory machines on parallel machines that only can communicate via a distributed memory.

Supported in part by DFG-Grant Me 872/1-4 in the Schwerpunktprogramm “Datenstrukturen und effiziente Algorithmen”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. J. Anderson and G. L. Miller. Optical communication for pointer based algorithms. Technical Report CRI 88-14, University of Southern California, Comp. Sci. Dept., 1988.

    Google Scholar 

  2. H. Bast and T. Hagerup. Fast and reliable parallel hashing. In Proc. of the 3rd Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 50–61, 1991.

    Google Scholar 

  3. H. Bast and T. Hagerup. Personal communication. 1991.

    Google Scholar 

  4. J. L. Carter and M. N. Wegman. Universal classes of hash functions. J. Comput. Syst. Sci., 18:143–154, 1979.

    Article  Google Scholar 

  5. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. Technical Report 77, Universität-GH-Paderborn, Fachbereich Mathematik/Informatik, Jan. 1991. Revised Version of the paper of the same title that appeared in Proc. of the 29th IEEE Ann. Symp. on Foundations of Computer Science, pages 524–531, 1988.

    Google Scholar 

  6. M. Dietzfelbinger and F. Meyer auf der Heide. An optimal parallel dictionary. In Proc. of the 1989 ACM Symp. on Parallel Algorithms and Architectures, pages 360–368, 1989. (Revised version to appear in Information and Computation).

    Google Scholar 

  7. M. Dietzfelbinger and F. Meyer auf der Heide. How to distribute a dictionary in a complete network. In Proc. of the 22nd Ann. ACM Symp. on Theory of Computing, pages 117–127, 1990.

    Google Scholar 

  8. M. Dietzfelbinger and F. Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In M. S. Paterson, editor, Proceedings of 17th ICALP, pages 6–19. Springer, 1990. Lecture Notes in Computer Science 443.

    Google Scholar 

  9. M. Dietzfelbinger and F. Meyer auf der Heide. Dynamic hashing in real time. To appear, 1992.

    Google Scholar 

  10. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with (O(1) worst case access time. J. Assoc. Comput. Mach., 31(3):538–544, July 1984.

    MathSciNet  Google Scholar 

  11. J. Gil, Y. Matias, and U. Vishkin. Towards a theory of nearly constant time parallel algorithms. In Proc. of the 32nd IEEE Ann. Symp. on Foundations of Computer Science, pages 698–710, 1991.

    Google Scholar 

  12. G. H. Gönnet. Expected length of the longest probe sequence in hash code searching. J. Assoc. Comput. Mach., 28(2):289–304, Apr. 1981.

    Google Scholar 

  13. T. Hagerup. Constant-time parallel integer sorting. In Proc. of the 23rd Ann. ACM Symp. on Theory of Computing, pages 299–306, 1991.

    Google Scholar 

  14. W. Hoeffding. Probability inequalites for sums of bounded random variables. J. Am. Stat. Ass., 58:13–30, 1963.

    Google Scholar 

  15. R. M. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PRAM simulation on a distributed memory machine. In Preparation, 1991.

    Google Scholar 

  16. Y. Matias and U. Vishkin. Converting high probability into nearly-constant time-with applications to parallel hashing. In Proc. of the 23rd Ann. ACM Symp. on Theory of Computing, pages 307–316, 1991.

    Google Scholar 

  17. C. McDiarmid. On the method of bounded differences. In J. Siemons, editor, Surveys in Combinatorics, 1989, pages 148–188. Cambridge University Press, 1989. London Math. Soc. Lecture Note Series 141.

    Google Scholar 

  18. K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. Springer-Verlag, Berlin, 1984.

    Google Scholar 

  19. K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21:339–374, 1984.

    Article  Google Scholar 

  20. A. Siegel. On universal classes of fast high performance hash functions, their timespace tradeoff, and their applications. In Proc. of the 30th IEEE Ann. Symp. on Foundations of Computer Science, pages 20–25, 1989. Revised Version.

    Google Scholar 

  21. L. G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, chapter 18, pages 943–971. Elsevier, Amsterdam, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 17. Mathematik-Informatik and Heinz-Nixdorf-Institut, Universität-GH-Paderborn, D-W-4790, Paderborn, Germany

    Martin Dietzfelbinger & Friedhelm Meyer auf der Heide

Authors
  1. Martin Dietzfelbinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedhelm Meyer auf der Heide
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien Th. Ottmann

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Dietzfelbinger, M., auf der Heide, F.M. (1992). High performance universal hashing, with applications to shared memory simulations. In: Monien, B., Ottmann, T. (eds) Data structures and efficient algorithms. Lecture Notes in Computer Science, vol 594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55488-2_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-55488-2_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55488-2

  • Online ISBN: 978-3-540-47103-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation