Efficient Multithreaded Context ID Allocation in MPI*
|Title||Efficient Multithreaded Context ID Allocation in MPI*|
|Publication Type||Conference Paper|
|Year of Publication||2012|
|Authors||Dinan, J, Goodell, D, Gropp, WD, Thakur, R, Balaji, P|
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.