paper-with-me

홈 › Papers

Relay Buffer Independent Communication over Pooled HBM for Efficient MoE Inference on Ascend

2026-05-07 · Tianlun Hu, Tiancheng Hu, Shengsheng Litang, Sheng Wang, Xiaoming Bao, Yuxing Li, Wei Wang, Zhongzhe Hu, Lijun Li, Hongwei Sun, Jingbin Zhou arxiv

Mixture-of-Experts (MoE) inference requires large-scale token exchange across devices, making dispatch and combine major bottlenecks in both prefill and decode. Beyond network transfer, routing-driven layout transformation, temporary relay, and output restoration can add substantial overhead. Existing MoE communication paths are often buffer-centric, using explicit inter-process relay and reordering buffers around collective transfer. This report presents a relay-buffer-free communication design for MoE inference acceleration on Ascend systems. The design reorganizes dispatch and combine around direct placement into destination expert windows and direct reading from remote expert windows. Built on globally pooled high-bandwidth memory and symmetric-memory allocation, it removes most intermediate relay and reordering buffers while retaining only lightweight control state, including counts, offsets, and synchronization metadata. We instantiate the design as two schedules for the main phases of MoE inference: a prefill schedule with richer planning state for throughput-oriented execution, and a compact decode schedule for latency-sensitive execution. Experiments on Ascend-based MoE workloads show reduced dispatch and combine latency in both settings. At the serving level, the implementation improves time to first token (TTFT), preserves competitive time per output token (TPOT), and enlarges the feasible scheduling space under practical latency constraints. These results indicate that, on platforms with globally addressable device memory, reducing intermediate buffering and output restoration around expert execution is an effective direction for accelerating MoE inference.

📄 PDF Abstract BibTeX arXiv:2605.06055

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Delay Constrained Buffer-Aided Relay Selection in the Internet of Things with Decision-Assisted Reinforcement Learning

2020-11-20 · Chong Huang, Gaojie Chen, Yu Gong

This paper investigates the reinforcement learning for the relay selection in the delay-constrained buffer-aided networks. The buffer-aided relay selection significantly improves the outage performance but often at the p…

Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

UAV-Assisted Communication in Remote Disaster Areas using Imitation Learning

2021-04-02 · Alireza Shamsoshoara, Fatemeh Afghah, Erik Blasch, Jonathan Ashdown 외

The damage to cellular towers during natural and man-made disasters can disturb the communication services for cellular users. One solution to the problem is using unmanned aerial vehicles to augment the desired communic…

Imitation LearningScheduling

Average AoI Minimization for Energy Harvesting Relay-aided Status Update Network Using Deep Reinforcement Learning

2023-06-02 · Sin-Yu Huang, Kuang-Hao, Liu

A dual-hop status update system aided by energy harvesting (EH) relays with finite data and energy buffers is studied in this work. To achieve timely status updates, the best relays should be selected to minimize the ave…

Deep Reinforcement Learning

Optimal Cooperative Cognitive Relaying and Spectrum Access for an Energy Harvesting Cognitive Radio: Reinforcement Learning Approach

2014-03-30 · Ahmed El Shafie, Tamer Khattab, Hussien Saad, Amr Mohamed

In this paper, we consider a cognitive setting under the context of cooperative communications, where the cognitive radio (CR) user is assumed to be a self-organized relay for the network. The CR user and the PU are assu…

Reinforcement Learning

Minimizing AoI in Resource-Constrained Multi-Source Relaying Systems with Stochastic Arrivals

2021-09-10 · Abolfazl Zakeri, Mohammad Moltafet, Markus Leinonen, Marian Codreanu

We consider a multi-source relaying system where the sources independently and randomly generate status update packets which are sent to the destination with the aid of a bufferaided relay through unreliable links. We fo…

Stochastic Optimization