Filtered by: Scheduling × Clear all

Fine-grained Computation-Communication Overlap via Tile-level Signaling and Scheduling for Mixture-of-Experts

Minyu Cui, Anna Wingkvist, Morgan Ericsson 2026-07-24

The problem is that conventional Mixture-of-Experts (MoE) implementations launch the return all-to-all communication after expert compute completes, exposing communication latency on the critical path and reducing GPU utilization. The method introduces a fine-grained producer-consumer co-design with tile-level signaling and scheduling, using a persistent per-rank computation kernel and a persistent communication kernel on a small dedicated SM partition to overlap expert compute with the second all-to-all. On a 4-A100 GPU platform, evaluated on three MoE models against four state-of-the-art MoE systems, the approach achieves up to 2.64x end-to-end speedup and 2.74x MoE-layer speedup. This matters because it provides a practical, non-intrusive way to improve distributed MoE execution efficiency on multi-GPU systems, enabling better scaling of large language models.

PDF

DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System

Yizou Chen, Tsun-Yu Yang, Zhisheng Hu, Baotong Lu 2026-07-24

Traditional graph processing systems on monolithic servers suffer from resource under-utilization, and existing disaggregated memory (DM) systems are impractical due to poor scalability and excessive compute-side cache demands. DMG introduces a DM-friendly graph store, an adaptive update coordinator, and a two-stage workload manager to address these issues. Experiments show DMG achieves up to 4.9X better performance and reduces cache demands by up to 18.9X compared to state-of-the-art DM-based systems. This matters because DMG is the first practical, scalable, and cache-efficient graph processing system for DM architectures, enabling efficient handling of growing graph sizes in data centers.

PDF