Advertisement

Hash Functions for Datatype Signatures in MPI

  • Julien Langou
  • George Bosilca
  • Graham Fagg
  • Jack Dongarra
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Hash Function Type Signature Message Passing Interface Application Code Cyclic Redundancy Check 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Message Passing Interface Forum: MPI: A message-passing interface standard, http://www.mpi-forum.org
  2. 2.
    Message Passing Interface Forum: MPI: A message-passing interface standard. International Journal of Supercomputer Applications 8, 165–414 (1994)Google Scholar
  3. 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 CrossRefGoogle Scholar
  4. 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. 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)zbMATHGoogle Scholar
  6. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Julien Langou
    • 1
  • George Bosilca
    • 1
  • Graham Fagg
    • 1
  • Jack Dongarra
    • 1
  1. 1.Dept. of Computer ScienceThe University of TennesseeKnoxvilleUSA

Personalised recommendations