Pith. sign in

REVIEW 3 cited by

Shortcut-connected Expert Parallelism for Accelerating Mixture-of-Experts

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.05019 v3 pith:UMD2PP2V submitted 2024-04-07 cs.LG cs.CLcs.DC

classification cs.LGcs.CLcs.DC
keywords scmoecommunicationexpertmodelsparallelismachievescomputationenabling
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Expert parallelism has emerged as a key strategy for distributing the computational workload of sparsely-gated mixture-of-experts (MoE) models across multiple devices, enabling the processing of increasingly large-scale models. However, the All-to-All communication inherent to expert parallelism poses a significant bottleneck, limiting the efficiency of MoE models. Although existing optimization methods partially mitigate this issue, they remain constrained by the sequential dependency between communication and computation operations. To address this challenge, we propose ScMoE, a novel shortcut-connected MoE architecture integrated with an overlapping parallelization strategy. ScMoE decouples communication from its conventional sequential ordering, enabling up to 100% overlap with computation. Compared to the prevalent top-2 MoE baseline, ScMoE achieves speedups of 1.49 times in training and 1.82 times in inference. Moreover, our experiments and analyses indicate that ScMoE not only achieves comparable but in some instances surpasses the model quality of existing approaches.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. HD-MoE: Hybrid and Dynamic Parallelism for Mixture-of-Expert LLMs with 3D Near-Memory Processing

    cs.PF 2025-09 conditional novelty 6.0 of 10

    HD-MoE combines an offline linear-programming placement search with online expert pre-broadcast, cutting simulated MoE inference latency on 3D near-memory processors by 1.1-1.8x over tensor parallelism.

  2. MoETuner: Optimized Mixture of Expert Serving with Balanced Expert Placement and Token Routing

    cs.LG 2025-02 conditional novelty 5.0 of 10

    MoETuner formulates MoE expert placement as two ILPs to balance token loads and minimize inter-GPU communication, reporting 9.3% and 17.5% end-to-end inference speedups on Mixtral-8x7B.

  3. Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging

    cs.LG 2025-06 conditional novelty 4.0 of 10

    Sub-MoE compresses MoE LLMs by K-means clustering of experts plus frequency-weighted merging of right singular vectors after a shared SVD, and claims 96 and 86 percent retained accuracy at 25 and 50 percent expert red...

Pith tools