Skip to main content

Hash Functions for Datatype Signatures in MPI

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3666))

Abstract

Detecting misuse of datatypes in an application code is a desirable feature for an MPI library. To support this goal we investigate the class of hash functions based on checksums to encode the type signatures of MPI datatype. The quality of these hash functions is assessed in terms of hashing, timing and comparing to other functions published for this particular problem (Gropp, 7th European PVM/MPI Users’ Group Meeting, 2000) or for other applications (CRCs). In particular hash functions based on Galois Field enables good hashing, computation of the signature of unidatatype in \(\mathcal{O}\)(1) and computation of the concatenation of two datatypes in \(\mathcal{O}\)(1) additionally.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Message Passing Interface Forum: MPI: A message-passing interface standard, http://www.mpi-forum.org

  2. Message Passing Interface Forum: MPI: A message-passing interface standard. International Journal of Supercomputer Applications 8, 165–414 (1994)

    Google Scholar 

  3. Gropp, W.D.: Runtime checking of datatype signatures in MPI. In: Dongarra, J., Kacsuk, P., Podhorszki, N. (eds.) PVM/MPI 2000. LNCS, vol. 1908, pp. 160–167. Springer, Heidelberg (2000), http://www-unix.mcs.anl.gov/~gropp/bib/papers/2000/datatype.ps

    Chapter  Google Scholar 

  4. Plank, J.S.: A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems. Software – Practice & Experience, vol. 27, pp. 995–1012 (1997), http://www.cs.utk.edu/~plank/plank/papers/CS-96-332.html

  5. Knuth, D.E.: The Art of Computer Programming, 2nd edn. (Addison-Wesley Series in Computer Science and Information). Addison-Wesley Longman Publishing Co., Inc., Amsterdam (1978)

    MATH  Google Scholar 

  6. Koopman, P., Chakravarty, T.: Cyclic redundancy code (CRC) polynomial selection for embedded networks. In: IEEE Conference Proceeding, International Conference on Dependable Systems and Networks (DSN 2004), pp. 145–154 (2004)

    Google Scholar 

  7. Langou, J., Bosilca, G., Fagg, G., Dongarra, J.: TGZ for hash functions of MPI datatypes (2004), http://www.cs.utk.edu/~langou/articles/LBFD:05/2005-LBFD.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Langou, J., Bosilca, G., Fagg, G., Dongarra, J. (2005). Hash Functions for Datatype Signatures in MPI. In: Di Martino, B., Kranzlmüller, D., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2005. Lecture Notes in Computer Science, vol 3666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557265_14

Download citation

  • DOI: https://doi.org/10.1007/11557265_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29009-4

  • Online ISBN: 978-3-540-31943-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics