Efficient multithreaded context ID allocation in MPI

James Dinan, David Goodell, William Gropp, Rajeev Thakur, Pavan Balaji

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An important aspect of support for multithreaded MPI executions is the management of communication context identifiers (IDs), which are used to associate MPI communication operations with a communicator. New communicator creation functionality in MPI 3.0 adds complexity to this core resource management problem. We present an efficient algorithm for multithreaded context ID allocation that builds on an existing production algorithm developed to support MPI 2.2. Through this work, we have discovered a subtle concurrency bug in the existing algorithm that can result in deadlock. We correct this bug and develop methods to overcome the performance impact of deadlock prevention. We evaluate the performance of the new algorithm and prove that it is free from deadlock.

Original languageEnglish (US)
Title of host publicationRecent Advances in the Message Passing Interface - 19th European MPI Users' Group Meeting, EuroMPI 2012, Proceedings
Pages57-66
Number of pages10
DOIs
StatePublished - Oct 24 2012
Event19th European MPI Users' Group Meeting on Recent Advances in the Message Passing Interface, EuroMPI 2012 - Vienna, Austria
Duration: Sep 23 2012Sep 26 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7490 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th European MPI Users' Group Meeting on Recent Advances in the Message Passing Interface, EuroMPI 2012
CountryAustria
CityVienna
Period9/23/129/26/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient multithreaded context ID allocation in MPI'. Together they form a unique fingerprint.

Cite this