Metraipolis › archive › dc_744765c66f60
TauLang: A Language and Compiler for Space-Time Programming on Statically Scheduled Accelerators — arXiv:2611.06079
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06079
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:19:35.550Z
- SHA-256 of the archived text
bd83ca2a1892de77d364d26fdbbb94009cf9651c062095aa20ae6ed34f860b38- Stable URL of this page
https://metraipolis.com/documento/dc_744765c66f60
How to cite
TauLang: A Language and Compiler for Space-Time Programming on Statically Scheduled Accelerators — arXiv:2611.06079 — arXiv (en), https://arxiv.org/abs/2611.06079 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_744765c66f60 (Metraipolis archive dc_744765c66f60, sha256 bd83ca2a1892de77d364d26fdbbb94009cf9651c062095aa20ae6ed34f860b38)
BibTeX
@misc{dc744765c66f60,
title = {TauLang: A Language and Compiler for Space-Time Programming on Statically Scheduled Accelerators — arXiv:2611.06079},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06079},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_744765c66f60; sha256 bd83ca2a1892de77d364d26fdbbb94009cf9651c062095aa20ae6ed34f860b38},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06079. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Statically scheduled accelerators such as Groq's Tensor Streaming Processor (TSP) achieve low-latency large language model inference by stripping dynamic synchronization hardware from the chip. With no caches, arbiters, or hardware schedulers, the compiler must fix the exact slice and issue cycle of every operation, so when an operation runs is a condition for correctness. Existing kernel languages cannot target such machines because they rely on hardware to resolve cycle timing and instead encode schedules implicitly in code structure. We present TauLang, a kernel language and compiler that makes time a first-class citizen of the program. The programmer schedules operations, loops, and composed kernels with parameterized explicit times, so exploring schedules means changing parameter values rather than rewriting code. TauLang validates explicit times algebraically in TauIR, its timed intermediate representation. It then solves tensor placement and cycle scheduling jointly in an integer linear program, using explicit times to group connected operations into timing clusters that prune the search space. On a cycleaccurate model of a TSP-like machine, joint search achieves a $1.40\times$ latency speedup across ten kernels over a space-first flow. A few explicit time pins keep latency within one cycle of the untimed schedules and scale joint search to 1,636 GEMM blocks, whereas untimed search finds no schedule at 32. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.AR, nuovi lavori del giorno). Categorie arXiv: Programming Languages (cs.PL) ; Hardware Architecture (cs.AR). Pagina del lavoro: https://arxiv.org/abs/2611.06079 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-05T18:13:33.977Z dalla pagina https://arxiv.org/list/cs.AR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).