Pure: Evolving Message Passing To Better Leverage Shared Memory Within Nodes
James Psota, Armando Solar-Lezama
Abstract
Pure is a new programming model and runtime system explicitly designed to take advantage of shared memory within nodes in the context of a mostly message passing interface enhanced with the ability to use tasks to make use of idle cores. Pure leverages shared memory in two ways: (a) by allowing cores to steal work from each other while waiting on messages to arrive, and, (b) by leveraging efficient lock-free data structures in shared memory to achieve high-performance messaging and collective operations between the ranks within nodes. We use microbenchmarks to evaluate Pure's key messaging and collective features and also show application speedups up to 2.1× on the CoMD molecular dynamics and the miniAMR adaptive mesh refinement applications scaling up to 4,096 cores.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 194e1974-1b7b-4e49-8efa-fb677b2ddfa7Related papers
- Improving communication by optimizing on-node data movement with data layoutTuowen Zhao, Mary W. Hall, Hans Johansen, Samuel WilliamsPPoPP 2021 · 19 citations
- Enhance the Strong Scaling of LAMMPS on FugakuJianxiong Li, Tong Zhao, Zhuoqiang Guo, Shunchen Shi et al.SC 2023 · 3 citations
- Itoyori: Reconciling Global Address Space and Global Fork-Join Task ParallelismShumpei Shiina, Kenjiro TauraSC 2023 · 6 citations
- Towards Scalable Unstructured Mesh Computations on Shared Memory Many-CoresHaozhong Qiu, Chuanfu Xu, Jianbin Fang, Liang Deng et al.PPoPP 2024 · 8 citations
- Efficiently Supporting Dynamic Task Parallelism on Heterogeneous Cache-Coherent SystemsMoyang Wang, Tuan Ta, Lin Cheng, Christopher BattenISCA 2020 · 11 citations
