Wu-Chun Feng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wu-Chun Feng has a total of 73 co-authors. Here are the top co-authors by number of shared publications:
- Atharva Gondhalekar
Dept. of ECE, Virginia Tech, Blacksburg, VA, USA
3 shared publications - Edward K. Kao
MIT Lincoln Laboratory, Lexington, MA
3 shared publications - Hao Wang
Virginia Tech
3 shared publications - Mark Gardner
Virginia Tech, Blacksburg, VA, USA
3 shared publications - Nabayan Chaudhury
Virginia Tech, Blacksburg, USA
3 shared publications - Sonal Jha
Virginia Tech, Blacksburg, Virginia, USA
3 shared publications
Latest Publications
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 52-57
Beyond the HBM Wall: Coherent-Memory Oversubscription for AI Workloads on NVIDIA Grace Hopper
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 52-57
Open AccessBeyond the HBM Wall: Coherent-Memory Oversubscription for AI Workloads on NVIDIA Grace Hopper
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 35-40
A Preliminary Study on Simultaneous Coscheduling for Discrete GPU vs. Fused GPU
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 35-40
Open AccessA Preliminary Study on Simultaneous Coscheduling for Discrete GPU vs. Fused GPU
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 7-12
Grace or Hopper? A Case Study of Wait-Free Concurrent Queues on the NVIDIA Grace Hopper GH200 Superchip
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 7-12
Open AccessGrace or Hopper? A Case Study of Wait-Free Concurrent Queues on the NVIDIA Grace Hopper GH200 Superchip
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 166-176
A SYCLic Investigation of SYCL Ecosystems: UniSYCL for Heterogeneous Scaling
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 166-176
Open AccessA SYCLic Investigation of SYCL Ecosystems: UniSYCL for Heterogeneous Scaling
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 304-314
Sparsity-aware Fine-Grained Parallelization for Set Intersection Computations in Graph Datasets
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 304-314
Open AccessSparsity-aware Fine-Grained Parallelization for Set Intersection Computations in Graph Datasets
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 791-801
Chapel for Parallel AND Distributed GPU Computing: A Case Study with Jaccard Similarity
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.
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 791-801
Open AccessChapel for Parallel AND Distributed GPU Computing: A Case Study with Jaccard Similarity
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.
- Open Access
- 30 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
A Multimodal Graph-based Approach for Early and Explainable Health Risk Assessment
- 30 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessA Multimodal Graph-based Approach for Early and Explainable Health Risk Assessment
- Open Access
- 19 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 201-204
Computing Quantum, Not Quantum Computing: Through the Looking Glass of a Computer Scientist
- 19 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 201-204
Open AccessComputing Quantum, Not Quantum Computing: Through the Looking Glass of a Computer Scientist
- Open Access
- 19 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 309-317
On the Efficacy of PyTorch for High-Performance Computing: A Case Study in Computational Physics
- 19 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 309-317
Open AccessOn the Efficacy of PyTorch for High-Performance Computing: A Case Study in Computational Physics
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 213-215
Sparsity-aware Kernel Selection for Edge-Connected Jaccard Similarity in Graph Datasets
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 213-215
Open AccessSparsity-aware Kernel Selection for Edge-Connected Jaccard Similarity in Graph Datasets