Sep 2026· Proceedings of the ACM SIGOPS 32nd Symposium on Operating Systems Principles· 0 citations· 37 references
TL;DR
Wavel is presented, a fast and efficient compilation system for wafer-scale accelerators that introduces MeshIR to make executable schedules explicit, constructs them through two legal locality-preserving primitives, CUT and TUNE, and uses physical cost evaluation with structured pruning to keep search practical.
Abstract
Wafer-scale accelerators offer a new scaling point for AI infrastructure, but they also create a new compilation regime: communication cost varies sharply with location, and the space of possible placements and execution schedules is enormous. Existing GPU, distributed, and vendor compilation systems largely retain a sharding-oriented view and therefore fail to fully leverage these emerging accelerators, leaving the dominant physical scheduling decisions unresolved. We make a key observation: at wafer scale, the central complexity of compilation shifts from finding a logical shard plan to constructing an executable schedule that fixes placement, layout alignment, and execution ordering. Based on this observation, we present Wavel, a fast and efficient compilation system for wafer-scale accelerators. Wavel introduces MeshIR to make executable schedules explicit, constructs them through two legal locality-preserving primitives, CUT and TUNE, and uses physical cost evaluation with structured pruning to keep search practical. On WSE-3 hardware, Wavel delivers 1.31×-1.35× higher mean per-setting throughput than the expert-optimized WaferLLM and up to 1.85× speedup over the Full-Chip baseline on dense models; calibrated cost-model results predict a 2.97× speedup on MoE workloads over the same baseline.
Heterogeneous accelerator architectures offer an efficient path to performance for compute-intensive workloads. However, full-stack integration remains difficult. We present EAAC (Extensible Accelerator Architecture), a flexible and extensible compiler and hardware architecture designed to lower the overhead of hardwar...
Karl Herman Krause, Emad Jacob Maroun, Martin Schoeberl· 0 citations
This work presents MeshRT, the first wafer-scale system to achieve both ultra-low latency and high throughput for LLM inference via a novel system architecture, which is called compile-time governance of runtime dynamism.
Cong-Jie He, Le Xu, Zhan Lu et al.· Proceedings of the ACM SIGOP...· 0 citations
Loom, a tuning-free symbolic compiler framework for tile-based SPMD programs on spatial dataflow architectures, is presented, suggesting that hardware-derived symbolic compilation provides a retargetable alternative to profiling-based tuning for spatial dataflow architectures while remaining interpretable by keeping op...
He-Ru Wang, Wei Li, Zhen-Yu Bai et al.· arXiv.org· 0 citations
A critical survey of supercomputer architecture from early vector machines to contemporary exascale systems, with particular emphasis on three persistent challenges: memory hierarchy design, interconnection network scalability, and thermal management.
Oraye Godspower· International Journal of Com...· 0 citations
Modern systems-on-chip (SoCs) rely on heterogeneous accelerators for performance scaling. Memory access is a critical bottleneck, but the complexity of cache coherence and nuances of weak memory consistency models (which may vary from system to system) represent a significant designer burden to every load/store unit th...
Joseph Maheshe, G. Lemieux· IEEE International Conferenc...· 3 citations
Modular integration has emerged as the main pathway for scaling superconducting quantum processing units (QPUs) beyond the constraints of fabrication yield and physical footprint. Currently, two primary strategies lead this effort. Mirroring the"Scaling Up"and"Scaling Out"approaches in GPU architectures and AI infrastr...
Nikiforos Paraskevopoulos, S. de Bone, Mick Christophersen et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.