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

Zhihao Bai

dblp:234/8717 · DBLP profile ↗
← Back
9ranked-venue papers
2as first author
5since 2021 · last 2026
0000-0002-2223-1921ORCID · corroborated

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

Systems, architecture and hardware · 3 · 1 since 2021Computer networks · 3 · 3 since 2021Databases, data management, data science and information retrieval · 2Security and privacy · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author

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
7 papers
Cloud and datacenter computing · 26% High-performance computing · 24% Distributed systems · 23%
Artificial intelligence
3 papers
Efficient and distributed learning · 100%
Network and information security
1 paper
Network security · 50% Web and mobile security · 50%
Software engineering, system software, and programming languages
2 papers
Operating systems · 74% Software testing · 26%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
distributed training
1.122026
MegaScale-MoE: Large-Scale Communication-Efficient Training of Mixture-of-Experts Models in Production · EuroSys 2026
PipeSwitch: Fast Pipelined Context Switching for Deep Learning Applications · OSDI 2020
Machine learning › Efficient and distributed learning › distributed training
communication-efficient training
1.012026
MegaScale-MoE: Large-Scale Communication-Efficient Training of Mixture-of-Experts Models in Production · EuroSys 2026
Machine learning › Efficient and distributed learning › distributed training › large model training
mixture-of-experts training
1.012026
MegaScale-MoE: Large-Scale Communication-Efficient Training of Mixture-of-Experts Models in Production · EuroSys 2026
Machine learning › Efficient and distributed learning
distributed training and inference
0.812024
DistMind: Efficient Resource Disaggregation for Deep Learning Workloads · IEEE/ACM Trans. Netw. 2024
Distributed systems
distributed caching
0.822019
DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching · USENIX ATC 2019
DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching · FAST 2019
Distributed systems
distributed coordination
0.812024
MegaScale: Scaling Large Language Model Training to More Than 10, 000 GPUs · NSDI 2024
High-performance computing
fault tolerance at scale
0.812024
MegaScale: Scaling Large Language Model Training to More Than 10, 000 GPUs · NSDI 2024
High-performance computing › large-scale training
large-scale training systems
0.812024
MegaScale: Scaling Large Language Model Training to More Than 10, 000 GPUs · NSDI 2024
Parallel and multicore computing
load balancing
0.822019
DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching · USENIX ATC 2019
DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching · FAST 2019
Cloud and datacenter computing
resource disaggregation
0.812024
DistMind: Efficient Resource Disaggregation for Deep Learning Workloads · IEEE/ACM Trans. Netw. 2024
Cloud and datacenter computing › cloud platform
container cloud
0.712023
Transparent GPU Sharing in Container Clouds for Deep Learning Workloads · NSDI 2023
GPUs and heterogeneous computing
GPU scheduling
0.712023
Transparent GPU Sharing in Container Clouds for Deep Learning Workloads · NSDI 2023
GPUs and heterogeneous computing
GPU sharing
0.712023
Transparent GPU Sharing in Container Clouds for Deep Learning Workloads · NSDI 2023
Cloud and datacenter computing
resource management
0.712023
Transparent GPU Sharing in Container Clouds for Deep Learning Workloads · NSDI 2023
Network security › attack strategy
denial-of-service attack
0.512021
Runtime Recovery of Web Applications under Zero-Day ReDoS Attacks · SP 2021
Web and mobile security
web application security
0.512021
Runtime Recovery of Web Applications under Zero-Day ReDoS Attacks · SP 2021
Operating systems › resource management › process management
context switching
0.412020
PipeSwitch: Fast Pipelined Context Switching for Deep Learning Applications · OSDI 2020
Software-defined and programmable networks
programmable data plane
0.412019
Harmonia: Near-Linear Scalability for Replicated Storage with In-Network Conflict Detection · Proc. VLDB Endow. 2019
Storage systems › data redundancy
replicated storage
0.412019
Harmonia: Near-Linear Scalability for Replicated Storage with In-Network Conflict Detection · Proc. VLDB Endow. 2019
Distributed systems
replication
0.412019
Harmonia: Near-Linear Scalability for Replicated Storage with In-Network Conflict Detection · Proc. VLDB Endow. 2019
High-performance computing
large-scale training
0.312026
MegaScale-MoE: Large-Scale Communication-Efficient Training of Mixture-of-Experts Models in Production · EuroSys 2026
High-performance computing
performance optimization at scale
0.312026
MegaScale-MoE: Large-Scale Communication-Efficient Training of Mixture-of-Experts Models in Production · EuroSys 2026
Cloud and datacenter computing › resource allocation › hardware resource assignment
GPU resource allocation
0.212024
DistMind: Efficient Resource Disaggregation for Deep Learning Workloads · IEEE/ACM Trans. Netw. 2024

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

communication optimization · 2.0three-stage pipelining · 1.5cache-aware load balancing · 1.5DNN-aware sharding · 1.5sandboxing · 1.0mixture-of-experts · 1.0mixture of experts · 1.0machine learning classification · 1.0feedback loop · 1.0pipelining · 0.9pipeline parallelism · 0.8mixed precision training · 0.8data parallelism · 0.8power of two choices · 0.4in-network conflict detection · 0.4consistent hashing · 0.4
YearPublicationVenuePosition
2026 MegaScale-MoE: Large-Scale Communication-Efficient Training of Mixture-of-Experts Models in Production
abstract
We present MegaScale-MoE, a production system tailored for the efficient training of large-scale mixture-of-experts (MoE) models. MoE emerges as a promising architecture to scale large language models (LLMs) to unprecedented sizes, thereby enhancing model performance. However, existing MoE training systems experience a degradation in training efficiency, exacerbated by the escalating scale of MoE models and the continuous evolution of hardware.
Chao Jin 0007, Ziheng Jiang, Zhihao Bai, Juncai Liu, Xiang Li 0067, Ningxin Zheng, Qi Huang 0001, Wen Heng, Yiyuan Ma, Wenlei Bao, Size Zheng 0001, Xuegui Zheng, Yanghua Peng, Haibin Lin, Xuanzhe Liu, Xin Jin 0008, Xin Liu 0086
EuroSys3
2024 MegaScale: Scaling Large Language Model Training to More Than 10, 000 GPUs
Ziheng Jiang, Haibin Lin, Yinmin Zhong, Qi Huang 0001, Yangrui Chen, Zhi Zhang 0005, Yanghua Peng, Xiang Li 0067, Shibiao Nong, Yulu Jia, Sun He, Hongmin Chen, Zhihao Bai, Qi Hou, Shipeng Yan, Yiyao Sheng, Zhuo Jiang, Haohan Xu, Zhang Zhang 0003, Pengfei Nie, Leqi Zou, Sida Zhao, Zherui Liu, Xiaoying Jia 0001, Jianxi Ye, Xin Jin 0008, Xin Liu 0086
NSDI14
2024 DistMind: Efficient Resource Disaggregation for Deep Learning Workloads
abstract
Deep learning (DL) systems suffer from low resource utilization due to 1) monolithic server model that tightly couples compute and memory; and 2) limited sharing between different inference applications, and across inference and training, because of strict service level objectives (SLOs). To address this problem, we present, a disaggregated DL system that enables efficient multiplexing of DL applications with near-optimal resource utilization. decouples compute from host memory, and exposes the abstractions of a GPU pool and a memory pool, each of which can be independently provisioned. The key challenge is to dynamically allocate GPU resources to different applications based on their real-time demands while meeting strict SLOs. We tackle this challenge by exploiting the power of high-speed 100 Gbps networks, and design three-stage pipelining, cache-aware load balancing, and DNN-aware sharding mechanisms based on the characteristics of DL workloads, to achieve millisecond-scale application loading overhead and improve system efficiency. We have implemented a prototype of and integrated it with PyTorch. Experimental results on AWS EC2 show that achieves near 100% resource utilization, and compared with NVIDIA MPS and Ray, improves the throughput by up to 279% and reduces the inference latency by up to 94%.
Xin Jin 0008, Zhihao Bai, Zhen Zhang 0063, Yibo Zhu 0001, Yinmin Zhong, Xuanzhe Liu
IEEE/ACM Trans. Netw.2
2023 Transparent GPU Sharing in Container Clouds for Deep Learning Workloads
Bingyang Wu, Zhihao Bai, Xuanzhe Liu, Xin Jin 0008
NSDI3
2021 Runtime Recovery of Web Applications under Zero-Day ReDoS Attacks
abstract
Regular expression denial of service (ReDoS)— which exploits the super-linear running time of matching regular expressions against carefully crafted inputs—is an emerging class of DoS attacks to web services. One challenging question for a victim web service under ReDoS attacks is how to quickly recover its normal operation after ReDoS attacks, especially these zero-day ones exploiting previously unknown vulnerabilities.In this paper, we present RegexNet, the first payload-based, automated, reactive ReDoS recovery system for web services. RegexNet adopts a learning model, which is updated constantly in a feedback loop during runtime, to classify payloads of upcoming requests including the request contents and database query responses. If detected as a cause leading to ReDoS, RegexNet migrates those requests to a sandbox and isolates their execution for a fast, first-measure recovery.We have implemented a RegexNet prototype and integrated it with HAProxy and Node.js. Evaluation results show that RegexNet is effective in recovering the performance of web services against zero-day ReDoS attacks, responsive on reacting to attacks in sub-minute, and resilient to different ReDoS attack types including adaptive ones that are designed to evade RegexNet on purpose.
Zhihao Bai, Ke Wang 0040, Yinzhi Cao, Xin Jin 0008
SP1
2020 PipeSwitch: Fast Pipelined Context Switching for Deep Learning Applications
Zhihao Bai, Zhen Zhang 0063, Yibo Zhu 0001, Xin Jin 0008
OSDI1
2019 DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching
Zaoxing Liu, Zhihao Bai, Zhenming Liu, Changhoon Kim, Vladimir Braverman, Xin Jin 0008, Ion Stoica
FAST2
2019 DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching
Zaoxing Liu, Zhihao Bai, Zhenming Liu, Changhoon Kim, Vladimir Braverman, Xin Jin 0008, Ion Stoica
USENIX ATC2
2019 Harmonia: Near-Linear Scalability for Replicated Storage with In-Network Conflict Detection
abstract
Distributed storage employs replication to mask failures and improve availability. However, these systems typically exhibit a hard tradeoff between consistency and performance. Ensuring consistency introduces coordination overhead, and as a result the system throughput does not scale with the number of replicas. We present Harmonia, a replicated storage architecture that exploits the capability of new-generation programmable switches to obviate this tradeoff by providing near-linear scalability without sacrificing consistency. To achieve this goal, Harmonia detects read-write conflicts in the network, which enables any replica to serve reads for objects with no pending writes. Harmonia implements this functionality at line rate, thus imposing no performance overhead. We have implemented a prototype of Harmonia on a cluster of commodity servers connected by a Barefoot Tofino switch, and have integrated it with Redis. We demonstrate the generality of our approach by supporting a variety of replication protocols, including primary-backup, chain replication, Viewstamped Replication, and NOPaxos. Experimental results show that Harmonia improves the throughput of these protocols by up to 10 x for a replication factor of 10, providing near-linear scalability up to the limit of our testbed.
Zhihao Bai, Jialin Li 0001, Ellis Michael, Dan R. K. Ports, Ion Stoica, Xin Jin 0008
Proc. VLDB Endow.2