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

Yinan Yao

dblp:350/9690 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · conflict

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

Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
Distributed systems · 36% Cloud and datacenter computing · 28% Parallel and multicore computing · 28%
Computer networks
1 paper
Internet of things and sensor networks · 50% Datacenter networks · 50%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.912025
Flexible Job Scheduling With Spatial-Temporal Compatibility for In-Network Aggregation · IEEE Trans. Computers 2025
Distributed systems › data aggregation
in-network aggregation
0.912025
Flexible Job Scheduling With Spatial-Temporal Compatibility for In-Network Aggregation · IEEE Trans. Computers 2025
Parallel and multicore computing › parallel scheduling
training job scheduling
0.912025
Flexible Job Scheduling With Spatial-Temporal Compatibility for In-Network Aggregation · IEEE Trans. Computers 2025
Internet of things and sensor networks › wireless sensor network
in-network aggregation
0.812024
Host-driven In-Network Aggregation on RDMA · INFOCOM 2024
Datacenter networks
RDMA
0.812024
Host-driven In-Network Aggregation on RDMA · INFOCOM 2024
High-performance computing › collective communication
all-reduce
0.312025
Flexible Job Scheduling With Spatial-Temporal Compatibility for In-Network Aggregation · IEEE Trans. Computers 2025
Distributed systems › distributed machine learning
distributed training
0.312025
Flexible Job Scheduling With Spatial-Temporal Compatibility for In-Network Aggregation · IEEE Trans. Computers 2025
Machine learning › Efficient and distributed learning
distributed training
0.212024
Host-driven In-Network Aggregation on RDMA · INFOCOM 2024

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

p4-programmable switch · 1.5dual transmission paths · 1.5dynamic memory pooling · 0.9contention-aware scheduling · 0.9
YearPublicationVenuePosition
2025 GIT: Accelerating Distributed DNN Training via Similar Gradient Filtering
Yinan Yao, Yulong Li 0001, Wenxin Li 0001, Keqiu Li, Dehan Wen
ICA3PP (2)1
2025 SLENet: A Guidance-Enhanced Network for Underwater Camouflaged Object Detection
Xinxin Huang, Ningzhong Liu, Huiyu Zhou 0001, Yinan Yao
PRCV (16)5
2025 Flexible Job Scheduling With Spatial-Temporal Compatibility for In-Network Aggregation
abstract
In-Network Aggregation (INA) solutions represent the forefront in advancing All-Reduce, utilizing limited switch memory for efficient gradient aggregation. However, existing INA solutions primarily focus on enhancing aggregation efficiency, often overlooking the efficient utilization of memory. Isolation solutions typically pre-allocate resources for each job, leading to memory wastage due to the uncontrolled use of resources. In contrast, the sharing solutions encounter significant memory contention, resulting in performance degradation within a multi-tenant environment. In this paper, we propose DynaINA, a flexible job scheduler to support multi-tenant training. The core idea of DynaINA is to provide spatial and temporal compatibility between jobs. For spatial compatibility, DynaINA utilizes multiple dynamic memory pools to provide job isolation. For temporal compatibility, DynaINA employs contention-aware job scheduling to facilitate memory sharing. Furthermore, DynaINA prioritizes communication-intensive jobs, leveraging the benefits of INA to enhance overall performance in training clusters. Extensive experiments with popular vision and language models demonstrate that DynaINA reduces training time by up to 65.16% and improves switch memory utilization by up to 85.02% compared to state-of-the-art solutions in a 100Gbps network.
Yulong Li 0001, Wenxin Li 0001, Yinan Yao, Song Zhang 0008, Linxuan Zhong, Keqiu Li
IEEE Trans. Computers4
2024 Host-driven In-Network Aggregation on RDMA
abstract
Large-scale datacenter networks are increasingly using in-network aggregation (INA) and remote direct memory access (RDMA) techniques to accelerate deep neural network (DNN) training. However, existing research trends suggest that these two techniques are on an inevitable collision course. To fill this gap, we present FreeINA, a host-driven in-network aggregation aimed at providing RDMA reliable connection (RC) for multi-tenant learning settings. FreeINA relies on dual transmission paths to support RC compatibility, with one path for INA and another one for aggregation on end-host parameter server. With dynamic control of these two paths, FreeINA can leave the traditional in-server aggregation unaffected while ensuring INA’s reliability without modifying RDMA network interfaces (RNICs). To support multi-tenant learning, FreeINA employs all-reduce-level memory allocation, which can capture the well-known "on and off" DNN training pattern and thus improve switch memory efficiency. We have implemented a FreeINA prototype using P4-programmable switch and commercial RNICs, and evaluated it extensively using 100Gbps testbed. The results show that compared to the state-of-the-art solution—ATP, FreeINA improves single-job training speedup ratio by 1.20×, while improving the aggregation throughput by 2.65× in multi-job scenario.
Yulong Li 0001, Wenxin Li 0001, Yinan Yao, Keqiu Li
INFOCOM3