Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shreyansh Tripathi

dblp:391/2927 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0000-0001-9518-7557ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 87% Interconnection networks and networks-on-chip · 13%
Artificial intelligence
1 paper
Deep learning architectures and training · 50% Efficient and distributed learning · 50%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
communication scheduling
1.012026
Optimizing Mixture-of-Experts Inference Time via Model Deployment and Communication Scheduling · IEEE Trans. Netw. 2026
Machine learning › Deep learning architectures and training › mixture of experts
mixture-of-experts inference
1.012026
Optimizing Mixture-of-Experts Inference Time via Model Deployment and Communication Scheduling · IEEE Trans. Netw. 2026
Cloud and datacenter computing › cluster resource management and scheduling › cluster scheduling
GPU cluster scheduling
1.012026
Optimizing Mixture-of-Experts Inference Time via Model Deployment and Communication Scheduling · IEEE Trans. Netw. 2026
Cloud and datacenter computing
model deployment
1.012026
Optimizing Mixture-of-Experts Inference Time via Model Deployment and Communication Scheduling · IEEE Trans. Netw. 2026
Interconnection networks and networks-on-chip › interprocessor communication
all-to-all communication
0.312026
Optimizing Mixture-of-Experts Inference Time via Model Deployment and Communication Scheduling · IEEE Trans. Netw. 2026

Methods — techniques the papers use, named apart from their topics

combinatorial optimization · 2.0
YearPublicationVenuePosition
2026 Optimizing Mixture-of-Experts Inference Time via Model Deployment and Communication Scheduling
abstract
As machine learning models scale in size and complexity, their computational requirements become a significant barrier. Mixture-of-Experts (MoE) models alleviate this issue by selectively activating relevant experts. Despite this, MoE models are hindered by high communication overhead from all-to-all operations, low GPU utilization, and complications from heterogeneous GPU environments. This paper presents Comet, which optimizes both model deployment and all-to-all communication scheduling to address these challenges in MoE inference. Comet achieves minimal communication times by strategically ordering token transmissions in all-to-all communications. It improves GPU utilization by colocating experts from different models on the same device, avoiding the limitations of all-to-all communication. We analyze Comet’s optimization strategies theoretically across four common GPU cluster settings: exclusive vs. colocated models on GPUs, and homogeneous vs. heterogeneous GPUs. Comet provides optimal solutions for three cases, and for the remaining NP-hard scenario, it offers a polynomial-time sub-optimal solution with only a 1.09× degradation from the optimal, as shown in the simulation results. Comet is the first approach to minimize MoE inference time via optimal model deployment and communication scheduling across various scenarios. Evaluations demonstrate that Comet significantly accelerates inference, achieving speedups of up to 2.63× in homogeneous clusters and 2.91× in heterogeneous environments. Moreover, Comet enhances GPU utilization by up to 2.38× compared to existing methods.
Jialong Li 0006, Shreyansh Tripathi, Lakshay Rastogi, Yiming Lei 0002, Rui Pan 0003, Yiting Xia
IEEE Trans. Netw.2