2 citations · 3 across the 17 of their papers we have counts for
5 papers · 1 filter
Cyclotron: A Recurrence Language for Expressing Interprocessor Communication
Shiv Sundram, Akhilesh Balasingam, Nathan Zhang +2
We present Cyclotron, a compiler that expresses streaming dataflow algorithms using recurrence equations, which are then compiled to distributed topologies of interlinked processor…
Design Docs Are All You Need: An AI-native Machine-Learning Performance Tool
Samuel Kushnir, Kimia Noorbakhsh, Kavya Sreedhar +6
Machine-learning performance modeling is a uniquely hostile terrain for long-lived software: the assumptions baked into today's abstractions are invalidated by tomorrow's models an…
Compiling Bioinformatics Recurrences
Bala Vinaithirthan, Shiv Sundram, Sneha Goenka +1
Many bioinformatics algorithms, such as sequence alignment and structure prediction, can be expressed as recurrence equations over a dynamic programming matrix. Efficient implement…
TensorBench: Benchmarking Coding Agents on a Compiler-Based Tensor Framework
Bobby Yan, Fredrik Kjolstad
Repository-level coding benchmarks face a trade-off between task difficulty and evaluation reliability: tasks that challenge frontier models often involve large codebases with inco…
Partitioning Unstructured Sparse Tensor Algebra for Load-Balanced Parallel Execution
Atharva Chougule, Alexander J Root, Rubens Lacouture +3
Sparse tensor algebra is challenging to efficiently parallelize due to the irregular, data-dependent, and potentially skewed structure of sparse computation. We propose the first p…