ARRAY 2026 – Proceedings

12th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming (ARRAY 2026)

Portable Anomaly Detection for Distributed PGAS Programs Based on Array Mapping Abstractions
Raneem Abuyosef, Thomas Huddleston, Kirshanthan Sundararajah, and Martin Kong
(Ohio State University, USA; Virginia Tech, USA)
The Partitioned Global Address Space (PGAS) execution model is a promising alternative model to MPI. PGAS implementations offer several programmability advantages over their MPI counterparts while preserving the appeal of high-performance communication libraries. Among existing PGAS instances, Chapel and Unified Parallel-C (UPC) are some of the leading implementations. Unfortunately, despite multiple advances, anomaly detection support for PGAS programs, both at the language level and library level, has been largely ignored.
In this work, we propose new static analyses to detect various distributed, multi-locale anomalies in Chapel and UPC programs. We leverage constraint formulae to model Chapel/UPC semantics together with anomaly-specific constraints that encapsulate triggering conditions of the anomaly. Generated models are then checked with Z3 SMT solver to decide the existence of anomalies. While our implementation targets Chapel, the underlying approach generalizes to other PGAS languages, as we illustrate through a construct mapping to UPC. We demonstrate the effectiveness of our analyses on well-known scientific operators and communication patterns, comparing against native Chapel analyses and MPI debugging tools targeting lowered Chapel code. We further validate our approach with an evaluation on UPC programs.

@InProceedings{ARRAY26p1, author = {Raneem Abuyosef and Thomas Huddleston and Kirshanthan Sundararajah and Martin Kong}, title = {Portable Anomaly Detection for Distributed PGAS Programs Based on Array Mapping Abstractions}, booktitle = {Proc.\ ARRAY}, publisher = {ACM}, pages = {1-16}, doi = {10.1145/3815001.3815002}, year = {2026}, } Publisher's Version Article: pldiws26arraymain-p2-p doi:10.1145/3815001.3815002

Leveraging AI Ecosystem for Portable and Sustainable GPU Kernels in HPC
Yanbo Zhao, Zhaonan Meng, Sai Krishna Teja Varma Manthena, Xu Liu, Ajay Panyala, and Jiajia Li
(North Carolina State University, USA; Pacific Northwest National Laboratory, USA)
High-Performance Computing (HPC) applications increasingly depend on GPUs, yet developing optimized kernels across evolving GPU architectures remains a major productivity bottleneck. With a tile-based programming model, Triton, a Python-based domain-specific language from the AI ecosystem, presents a compelling opportunity to simplify high-performance GPU kernel development for HPC. However, its tight coupling with Python creates significant integration barriers. In this paper, we investigate the feasibility of leveraging Triton for traditional HPC development. We present a compilation framework that transforms Triton kernels into standalone shared objects with C-compatible interfaces, eliminating Python dependencies and enabling seamless integration into HPC codebases while preserving optimization and portability benefits. We validate the approach by replacing kernels in representative HPC workloads with simpler Triton implementations that deploy across NVIDIA and AMD GPUs without modification. Triton achieves near-parity performance with native implementations on tile-friendly workloads, while irregular kernels reveal current limitations of its tile-based programming model. These results suggest that bridging the AI and HPC ecosystems via Triton offers a practical path toward more productive, portable, and sustainable GPU kernel development for HPC.

@InProceedings{ARRAY26p17, author = {Yanbo Zhao and Zhaonan Meng and Sai Krishna Teja Varma Manthena and Xu Liu and Ajay Panyala and Jiajia Li}, title = {Leveraging AI Ecosystem for Portable and Sustainable GPU Kernels in HPC}, booktitle = {Proc.\ ARRAY}, publisher = {ACM}, pages = {17-29}, doi = {10.1145/3815001.3815003}, year = {2026}, } Publisher's Version Article: pldiws26arraymain-p3-p doi:10.1145/3815001.3815003

Refined Remora: Constraining Array Shapes
Vadym Matviichuk and Olin Shivers
(Northeastern University, USA)
Remora is a higher-order functional array programming language based on the rank-polymorphic computational model originally developed by Iverson for APL. Unlike APL, Remora has a dependent type system that captures array shapes for use by the parallelizing compiler. Given that the type system is decidably checkable and inferrable, it inevitably must have limits on its expressiveness. In this paper, we extend Remora's type system by allowing programmers to refine array shapes with extra constraints, which are then checked by an SMT solver. We develop the shape-refinement type extensions for Remora; evaluate its utility for refining the types of standard computational kernels, such as convolution, as well as total applications, such as the YOLO vision application; and prove its type soundness.

@InProceedings{ARRAY26p30, author = {Vadym Matviichuk and Olin Shivers}, title = {Refined Remora: Constraining Array Shapes}, booktitle = {Proc.\ ARRAY}, publisher = {ACM}, pages = {30-43}, doi = {10.1145/3815001.3815004}, year = {2026}, } Publisher's Version Article: pldiws26arraymain-p9-p doi:10.1145/3815001.3815004

proc time: 0.01