Metraipolis › archive › dc_39b67dbc5d98
HyperCut: Fast Inter-Layer Scheduling via Directed Hypergraph and Early Filtering — arXiv:2608.19296
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.19296
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T11:44:00.159Z
- SHA-256 of the archived text
1d0436b818ed1ead97e2b46b8a2521f843d299a0680f0bdc8965564591ebe4a4- Stable URL of this page
https://metraipolis.com/documento/dc_39b67dbc5d98
How to cite
HyperCut: Fast Inter-Layer Scheduling via Directed Hypergraph and Early Filtering — arXiv:2608.19296 — arXiv (en), https://arxiv.org/abs/2608.19296 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_39b67dbc5d98 (Metraipolis archive dc_39b67dbc5d98, sha256 1d0436b818ed1ead97e2b46b8a2521f843d299a0680f0bdc8965564591ebe4a4)
BibTeX
@misc{dc39b67dbc5d98,
title = {HyperCut: Fast Inter-Layer Scheduling via Directed Hypergraph and Early Filtering — arXiv:2608.19296},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.19296},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_39b67dbc5d98; sha256 1d0436b818ed1ead97e2b46b8a2521f843d299a0680f0bdc8965564591ebe4a4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.19296. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
As deep neural networks (DNNs) continue to scale, inter-layer scheduling, which orchestrates the spatial allocation of compute resources and the temporal execution order across layers, has become a decisive factor in sustaining high utilization and energy efficiency on tiled accelerators. However, existing inter-layer schedulers defer cost feedback until a complete fine-grained intra-layer scheduling has been resolved. The resulting decoupled flow repeatedly explores sub-optimal or even infeasible inter-layer schedules, and the absence of early pruning during the inter-layer phase remains a critical bottleneck for design-space exploration (DSE) in DNN compilers. Our key observation is that the cost of an intra-layer scheduling can be tightly upper-bounded once the inter-layer cut fixes the sub-mesh shape, which lets us cost every inter-layer candidate without solving the intra-layer problem. Hence, we propose a hierarchical partitioning-and-mapping framework, HyperCut, that enables early filtering of inter-layer schedules based on hypergraph partitioning. Based on the directed hypergraph (DHG) abstraction of DNN, we introduce a unified representation, State, that jointly encodes the DHG partition, tile mesh allocation and tensor batch splitting. Thereby, partitioning and mapping are coupled into a union optimization object. For a DNN with N layers, the resulting theoretical design space is bounded by O(N), compared with O(9.899^N) for the state-of-the-art open-source scheduler SET. Across 10 evaluated cases, HyperCut achieves 2.0x performance improvement and 80.47% exploration time reduction over the SET baseline, measured by geometric mean. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-21 in cs.AR). Categorie arXiv: Hardware Architecture (cs.AR). Pagina del lavoro: https://arxiv.org/abs/2608.19296 — 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-10-18T11:39:29.369Z dalla pagina https://arxiv.org/catchup/cs.AR/2026-08-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).