Sep 2026· Proceedings of the International Conference on Parallel Processing· 0 citations· 35 references
TL;DR
Overall, when evaluating both Chapel and MPI+X implementations of partitioned Jaccard similarity on up to 16 A100-80GB GPUs across four nodes, Chapel achieves comparable performance to MPI+X while also delivering significantly better programmer productivity and agility.
Abstract
This work explores the efficacy of the Chapel programming language’s GPU support for implementing irregular distributed GPU graph applications. Chapel’s partitioned global address space (PGAS) model provides a cohesive way to target distributed nodes, CPU concurrency and task parallelism, and both CPU and GPU single instruction, multiple data/thread (SIMD/SIMT) kernels. In contrast, dominant high-performance computing approaches often require interoperation of multiple programming models for inter- and intra-node operations. This work considers developer and performance impacts of using Chapel over such traditional approaches. To facilitate, we first create a novel tiled partitioning of the edge-connected Jaccard similarity graph workload in both Chapel and MPI+OpenMP+CUDA (i.e. MPI+X). We then evaluate Chapel’s first-class distributed GPU capability relative to a traditional one-sided MPI, OpenMP task, and CUDA approach. We contrast how the programming models express GPU, I/O, tasking, and remote data accesses, as well as the relative code bulk required. Finally, we evaluate performance attained by our Chapel implementation on real-world datasets, both relative to the MPI+X solution and a single-GPU pure CUDA baseline. Overall, when evaluating both Chapel and MPI+X implementations of partitioned Jaccard similarity on up to 16 A100-80GB GPUs across four nodes, Chapel achieves comparable performance to MPI+X while also delivering significantly better programmer productivity and agility.
Unified memory allows a central processing unit (CPU) and a graphics processing unit (GPU) to share data, simplifying the development of applications that use both processors. However, a shared memory interface does not eliminate the performance effects of where data reside, how often they are reused, or how the proces...
Simulation of HPC applications is an essential tool for analyzing system design trade-offs and enabling effective hardware--software co-design. As modern supercomputers increasingly rely on GPU acceleration, MPI implementations have evolved to support GPU-aware communication, enabling direct GPU data transfers. Modelin...
Ahmad Moh'd Saleh A. Belbeisi, A. Raoofy, Josef Weidendorfer et al.· 0 citations
Communication has become a bottleneck in distributed training and inference of large models. Overlapping communication with computation at the granularity of kernels, on separate streams, reduces only part of this communication cost. Fused kernels often have better performance by transmitting each output tile as soon a...
Zi-Ming Mao, Yi-Han Zhang, S. W. Chew et al.· 1 citation
The Maximum Common Subgraph (MCS) problem is a fundamental challenge in graph theory. It generalizes the subgraph isomorphism problem and is known to be NP-complete and difficult to approximate. This inherent complexity underscores the need for efficient solutions. This work introduces Hydra-MCS, a novel hybrid CPU-GPU...
Lorenzo Cardone, Stefano Quer· IEEE Transactions on Paralle...· 0 citations
This work presents parallel algorithms for computing dependent partitions, and shows that these algorithms perform well on accelerators like GPUs and enable dynamic and on-line partitioning during steady-state execution.
Rohan R. Chanani, Alex Aiken, Michael Bauer et al.· 0 citations
Experiments conducted on a real heterogeneous CPU-GPU cluster using diverse GPU workloads demonstrate that the performance of the GDSF computing framework and its scheduling algorithms meets the expected research objectives, thus validating the feasibility and effectiveness of the proposed design.
Qin-Lu He, Fan Zhang, Gen-Qing Bian et al.· Cluster Computing· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.