Thread-safety in an MPI implementation: Requirements and analysis

The MPI-2 Standard has carefully specified the interaction between MPI and user-created threads. The goal of this specification is to allow users to write multithreaded MPI programs while also allowing MPI implementations to deliver high performance. However, a simple reading of the thread-safety sp...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel computing Ročník 33; číslo 9; s. 595 - 604
Hlavní autoři: Gropp, William, Thakur, Rajeev
Médium: Journal Article
Jazyk:angličtina
Vydáno: United States Elsevier B.V 01.09.2007
Témata:
97
ALGORITHMS
DATA TRANSMISSION
GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
IMPLEMENTATION
Message-passing interface (MPI)
MPI implementation
Multithreaded programming
SAFETY
SPECIFICATIONS
Thread-safety
Message-passing interface (MPI)
MPI implementation
Multithreaded programming
Thread-safety
ISSN:0167-8191, 1872-7336
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The MPI-2 Standard has carefully specified the interaction between MPI and user-created threads. The goal of this specification is to allow users to write multithreaded MPI programs while also allowing MPI implementations to deliver high performance. However, a simple reading of the thread-safety specification does not reveal what its implications are for an implementation and what implementers must be aware (and careful) of. In this paper, we describe and analyze what the MPI Standard says about thread-safety and what it implies for an implementation. We classify the MPI functions based on their thread-safety requirements and discuss several issues to consider when implementing thread-safety in MPI. We use the example of generating new context ids (required for creating new communicators) to demonstrate how a simple solution for the single-threaded case does not naturally extend to the multithreaded case and how a naïve thread-safe algorithm can be expensive. We then present an algorithm for generating context ids that works efficiently in both single-threaded and multithreaded cases.
Bibliografie:USDOE Office of Science (SC)
DE-AC02-06CH11357
ANL/MCS/JA-59091
ISSN:0167-8191
1872-7336
DOI:10.1016/j.parco.2007.07.002