mlsanityData to 14 Oct 2026

Dato: A Task-Based Programming Model for Dataflow Accelerators

arXiv 2509.06794 ↗First posted 8 Sep 2025cs.PL cs.AR cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Recent deep learning workloads increasingly push computational demand beyond what current memory systems can sustain, with many kernels stalling on data movement rather than computation. While modern dataflow accelerators incorporate on-chip streaming to mitigate off-chip bandwidth limitations, existing programming models struggle to harness these capabilities effectively. Low-level interfaces provide fine-grained control but impose significant development overhead, whereas high-level tile-based languages abstract away communication details, restricting optimization and forcing compilers to reconstruct the intended dataflow. We present Dato, a Python-embedded, task-based programming model for dataflow accelerators that elevates data communication and sharding to first-class type constructs. Developers write programs as a graph of tasks connected via explicit stream types, with sharded inputs specified using layout types. These tasks are first mapped virtually onto the accelerator's spatial fabric, and the compiler then generates a physical mapping that respects hardware constraints. Experimental results on both AMD Ryzen AI NPU and Alveo FPGA devices demonstrate that Dato achieves high performance while significantly reducing the burden of writing optimized code. On the NPU, Dato attains up to 84% hardware utilization for GEMM and delivers a 2.81x speedup on attention kernels compared to a state-of-the-art commercial framework. On the FPGA, Dato surpasses leading frameworks in performance when generating custom systolic arrays, achieving 98% of the theoretical peak performance.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 18 of its 55 references that are in the map. First posted on arXiv 8 Sep 2025.

Builds on

18 of 55 references.

References · 18

  1. 2017Attention Is All You Needcited by 60,361
  2. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  3. 2017In-Datacenter Performance Analysis of a Tensor Processing Unitcited by 618
  4. 2023TPU v4: An Optically Reconfigurable Supercomputer for Machine Learning with Hardware Support for Embeddingscited by 202
  5. 2021GSPMD: General and Scalable Parallelization for ML Computation Graphscited by 111
  6. 2023Understanding the Potential of FPGA-Based Spatial Acceleration for Large Language Model Inferencecited by 33
  7. 2024Allo: A Programming Model for Composable Accelerator Designcited by 16
  8. 2023Slapo: A Schedule Language for Progressive Optimization of Large Deep Learning Model Trainingcited by 11
  9. 2025Efficiency, Expressivity, and Extensibility in a Close-to-Metal NPU Programming Interfacecited by 9
  10. 2020Taskflow: A Lightweight Parallel and Heterogeneous Task Graph Computing Systemcited by 6
  11. 2023Revet: A Language and Compiler for Dataflow Threadscited by 6
  12. 2022TAPA: A Scalable Task-Parallel Dataflow Programming Framework for Modern FPGAs with Co-Optimization of HLS and Physical Designcited by 5
6 more
  1. 2025Stream-HLS: Towards Automatic Dataflow Accelerationcited by 5
  2. 2021Synthesizing Optimal Parallelism Placement and Reduction Strategies on Hierarchical Systems for Deep Learningcited by 4
  3. 2025Linear Layouts: Robust Code Generation of Efficient Tensor Computation Using mathbbF2cited by 4
  4. 2025Tilus: A Tile-Level GPGPU Programming Language for Low-Precision Computationcited by 3
  5. 2024Flo: a Semantic Foundation for Progressive Stream Processingcited by 1
  6. 2024Enhancing CGRA Efficiency Through Aligned Compute and Communication Provisioningcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 3.

5 papers.