Array-oriented programming unites two properties that demand close synergy and interaction. As an abstraction, it directly reflects the high-level mathematical concepts that underlie fields ranging from the natural sciences and engineering to high-performance computing and financial modeling. As a language feature, it provides regular control flow, exposes structured data dependencies, supports view-based reshaping, manages sparsity, and–above all–lends itself naturally to a wide range of program analyses.
The ARRAY workshop series examines all aspects of array programming, such as languages, formal semantics, type systems, array theories, productivity–performance trade-offs, libraries, axis- versus index-based notations, intermediate representations, efficient compilation, automated synthesis, and layout or locality optimizations. It especially invites industrial participation from companies who are investigating ``tile-oriented'' programming models, as these can be fruitful points of early academic research engagement.
Array programming is at home in many communities, including language design, library development, optimization, scientific computing, trustworthy machine learning and across many existing language communities. ARRAY is intended as a forum where these communities can exchange ideas on the construction of computational tools for manipulating arrays as well as fundamental principles of array programming.
Highlights
Accepted Papers
Call for Papers
Array programming is at home in many communities, including language design, library development, optimization, scientific computing, and across many existing language communities. The ARRAY Workshop series is intended to bring together researchers from many different practical and theoretical communities, including language designers, library developers, type theorists, compiler researchers, and practitioners. These communities can exchange ideas on the construction of computational tools for manipulating arrays and fundamental principles of array programming. Submissions are welcome in two categories: full papers and extended abstracts. All submissions should be formatted in conformance with the ACM SIGPLAN proceedings style. Accepted submissions in either category will be presented at the workshop. The ARRAY series of workshops explores:
-
tile-based and tensor-based languages and optimization
-
formal semantics and design issues of array-oriented languages and libraries;
-
correctness of array programs, including type-theoretic issues, formal verification, array models, static analysis;
-
productivity and performance in compute-intensive application areas of array programming;
-
systematic notation for array programming, including axis- and index-based approaches;
-
intermediate languages, virtual machines, and program-transformation techniques for array programs;
-
representation of and automated reasoning about mathematical structure, such as static and dynamic sparsity, low-rank patterns, and hierarchies of these, with connections to applications such as graph processing, HPC, tensor computation and deep learning;
-
interfaces between array- and non-array code, including approaches for embedding array programs in general-purpose programming languages; and
-
efficient mapping of array programs, through compilers, libraries, and code generators, onto execution platforms, targeting multi-cores, SIMD devices, GPUs, distributed systems, and FPGA hardware, by fully automatic and user-assisted means.
All submissions must be in PDF format, printable in black and white on US Letter sized paper. Papers must adhere to the standard SIGPLAN conference format: two columns, ten-point font.
Full papers may be up to 12 pages (excluding references), on any topic related to the focus of the workshop. They will be thoroughly reviewed according to the usual criteria of relevance, soundness, novelty, and significance; accepted submissions will be published in the ACM Digital Library.
Extended abstracts may be up to 2 pages (excluding references); they may describe work in progress, tool demonstrations, and summaries of work published in full elsewhere. The focus of the extended abstract should be to explain why the proposed presentation will be of interest to the ARRAY audience. Submissions will be lightly reviewed only for relevance to the workshop, and will not published in the DL.
AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. (For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.)
This program is tentative and subject to change.
Tue 16 JunDisplayed time zone: Mountain Time (US & Canada) change
09:00 - 10:10 | |||
09:00 10mDay opening | Welcoming Remarks ARRAY | ||
09:10 50mKeynote | Tiles, Bricks, and Layouts: How Aggregate Data Abstractions Aid in Optimizing Data Movement ARRAY Mary Hall University of Utah | ||
10:00 10mLive Q&A | Q&A for Keynote-1 ARRAY | ||
10:30 - 12:10 | |||
10:30 20mTalk | Refined Remora: Constraining Array Shapes ARRAY | ||
10:50 25mTalk | Relational Cell Morphing: Automated Verification of Relational Properties of Array Programs ARRAY Weihao Qu Monmouth University, Marco Gaboardi Boston University, Hiroshi Unno Tohoku University, Eric Koskinen Stevens Institute of Technology | ||
11:15 25mTalk | Graded Monoids for Dependently Typed Array Programming ARRAY Juuso Haavisto University of Oxford, Jeremy Gibbons Department of Computer Science, University of Oxford | ||
11:40 20mTalk | Portable Anomaly Detection for Distributed PGAS Programs based on Array Mapping Abstractions ARRAY Raneem Abu-Yosef Ohio State University, Thomas Huddleston The Ohio State University, Kirshanthan Sundararajah Virginia Tech, Martin Kong Ohio State University | ||
12:00 10mLive Q&A | Mini Panel ARRAY | ||
13:40 - 15:20 | |||
13:40 50mKeynote | Tile Programming Abstractions ARRAY Jared Roesch University of Washington, USA | ||
14:30 10mLive Q&A | Q&A for Keynote-2 ARRAY | ||
14:40 20mTalk | Tensor Algebra Equivalence Checker ARRAY | ||
15:00 20mTalk | Rhyme: A Multi-Paradigm Declarative Query Language ARRAY | ||
15:50 - 17:30 | |||
15:50 20mTalk | Vectorizing Sparse Coiteration for Two-finger Loop Structure (Extended Abstract) ARRAY | ||
16:10 25mTalk | Leveraging AI Ecosystem for Portable and Sustainable GPU Kernels in HPC ARRAY Yanbo Zhao North Carolina State University, Zhaonan Meng North Carolina State University, Sai Krishna Teja Varma Manthena NCSU, Xu Liu North Carolina State University, Ajay Panyala Pacific Northwest National Laboratory, Jiajia Li North Carolina State University | ||
16:35 20mTalk | Lazy Arithmetic using Systolic Arrays for Closing the Verification Gap on Embedded Systems ARRAY | ||
16:55 20mTalk | Towards a Linear-Algebraic Hypervisor ARRAY Pre-print | ||
17:15 5mResearch preview | Semantics as a Tool of Thought: Provenance-Aware Dimensional Checking in a Reactive Array IR ARRAY Christopher Buck None | ||
17:20 10mLive Q&A | Mini Panel ARRAY | ||