Hash functions for datatype signatures in MPI

  • Authors:
  • Julien Langou;George Bosilca;Graham Fagg;Jack Dongarra

  • Affiliations:
  • Dept. of Computer Science, The University of Tennessee, Knoxville, TN;Dept. of Computer Science, The University of Tennessee, Knoxville, TN;Dept. of Computer Science, The University of Tennessee, Knoxville, TN;Dept. of Computer Science, The University of Tennessee, Knoxville, TN

  • Venue:
  • PVM/MPI'05 Proceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.