Streaming Tensor Programs: A Streaming Abstraction for Dynamic Parallelism
Not on the map. Why?
Abstract (arXiv)
Dynamic behaviors are becoming prevalent in tensor applications, like machine learning, where many widely used models contain data-dependent tensor shapes and control flow. However, the limited expressiveness of prior programming abstractions for spatial dataflow accelerators (SDAs) forces these dynamic behaviors to be implemented statically and/or unoptimized. To address these challenges, we present Streaming Tensor Programs (STeP), a streaming abstraction that enables dynamic tensor workloads to run efficiently on SDAs. STeP introduces flexible routing operators, an explicit memory hierarchy, and symbolic-shape semantics that expose dynamic data rates and tensor dimensions. These capabilities unlock new optimizations, like dynamic tiling, dynamic parallelization, and configuration time-multiplexing, that adapt SDA execution to dynamic behaviors while preserving dataflow efficiency. Using a cycle-approximate simulator on representative LLM layers and a full model with real-world traces, STeP enables: dynamic tiling that breaks the Pareto-optimal frontier from prior work, dynamic parallelization that improves latency by ~2.72x, and configuration time-multiplexing that increases compute utilization by ~2.64x over prior SDA abstractions and their implementations.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 58 references that are in the map. First posted on arXiv 11 Nov 2025.
Builds on
23 of 58 references.
References · 23
- 2017Attention Is All You Needcited by 59,932
- 2025Qwen3 Technical Reportcited by 8,195
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2024Qwen2-VL: Enhancing Vision-Language Model's Perception of the World at Any Resolutioncited by 4,151
- 2025Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilitiescited by 3,655
- 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,829
- 2020GLU Variants Improve Transformercited by 1,724
- 2025gpt-oss-120b & gpt-oss-20b Model Cardcited by 1,258
- 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,107
- 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 834
- 2024DistServe: Disaggregating Prefill and Decoding for Goodput-optimized Large Language Model Servingcited by 595
- 2023Splitwise: Efficient generative LLM inference using phase splittingcited by 536
11 more
- 2024DynamoLLM: Designing LLM Inference Clusters for Performance and Energy Efficiencycited by 106
- 2024LLM-Inference-Bench: Inference Benchmarking of Large Language Models on AI Acceleratorscited by 31
- 2025Hunyuan-TurboS: Advancing Large Language Models through Mamba-Transformer Synergy and Adaptive Chain-of-Thoughtcited by 28
- 2023Ramulator 2.0: A Modern, Modular, and Extensible DRAM Simulatorcited by 26
- 2025Optimizing LLM Inference Throughput via Memory-aware and SLA-constrained Dynamic Batchingcited by 8
- 2020Taskflow: A Lightweight Parallel and Heterogeneous Task Graph Computing Systemcited by 6
- 2023Revet: A Language and Compiler for Dataflow Threadscited by 6
- 2020FIST: A Feature-Importance Sampling and Tree-Based Method for Automatic Design Flow Parameter Tuningcited by 5
- 2022The Sparse Abstract Machinecited by 3
- 2022Stardust: Compiling Sparse Tensor Algebra to a Reconfigurable Dataflow Architecturecited by 3
- 2024Kernel Looping: Eliminating Synchronization Boundaries for Peak Inference Performancecited by 1
Built on by
Not cited yet.