Tail queues: A multi‐threaded matching architecture. (6th February 2019)

• Record Type: Journal Article
• Authors: Dosanjh, Matthew G.F.; Grant, Ryan E.; Schonbein, Whit; Bridges, Patrick G.
• Other Names: Jin Hai guestEditor.; Shen Xipeng guestEditor.; Lovas Robert guestEditor.; Liao Xiaofei guestEditor.; Skjellum Anthony guestEditor.; Bangalore Purushotham V. guestEditor.; Grant Ryan E. guestEditor.
• Is Part Of: Concurrency and computation. Volume 32:Number 3(2020)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-02-06
• Subjects: high performance computing -- many core -- MPI -- networks; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5158
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: As we approach exascale, computational parallelism will have to drastically increase in order to meet throughput targets. Many‐core architectures have exacerbated this problem by trading reduced clock speeds, core complexity, and computation throughput for increasing parallelism. This presents two major challenges for communication libraries such as MPI: the library must leverage the performance advantages of thread level parallelism and avoid the scalability problems associated with increasing the number of processes to that scale. Hybrid programming models, such as MPI+X, have been proposed to address these challenges. MPI THREAD MULTIPLE is MPI's thread safe mode. While there has been work to optimize it, it largely remains non‐performant in most implementations. While current applications avoid MPI multithreading due to performance concerns, it is expected to be utilized in future applications. One of the major synchronous data structures required by MPI is the matching engine. In this paper, we present a parallel matching algorithm that can improve MPI matching for multithreaded applications. We then perform a feasibility study to demonstrate the performance benefit of the technique.