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

Yuntao Nie

dblp:411/1689 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · unresolved

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

Systems, architecture and hardware · 3 · 3 since 2021Software engineering, systems software and programming languages · 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.

Artificial intelligence
2 papers
Efficient and distributed learning · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Parallel and multicore computing · 56% Hardware accelerators and domain-specific architectures · 28% Memory systems · 8%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
distributed training
1.722025
DynPipe: Toward Dynamic End-to-End Pipeline Parallelism for Interference-Aware DNN Training · IEEE Trans. Parallel Distributed Syst. 2025
PopFetcher: Towards Accelerated Mixture-of-Experts Training Via Popularity Based Expert-Wise Prefetch · USENIX ATC 2025
Machine learning › Efficient and distributed learning › distributed training › large model training
mixture-of-experts training
0.912025
PopFetcher: Towards Accelerated Mixture-of-Experts Training Via Popularity Based Expert-Wise Prefetch · USENIX ATC 2025
Machine learning › Efficient and distributed learning › distributed training › model parallelism
pipeline parallelism
0.912025
DynPipe: Toward Dynamic End-to-End Pipeline Parallelism for Interference-Aware DNN Training · IEEE Trans. Parallel Distributed Syst. 2025
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.912025
PopFetcher: Towards Accelerated Mixture-of-Experts Training Via Popularity Based Expert-Wise Prefetch · USENIX ATC 2025
Parallel and multicore computing
parallel programming models
0.912025
DynPipe: Toward Dynamic End-to-End Pipeline Parallelism for Interference-Aware DNN Training · IEEE Trans. Parallel Distributed Syst. 2025
Parallel and multicore computing › task scheduling
pipeline scheduling
0.912025
DynPipe: Toward Dynamic End-to-End Pipeline Parallelism for Interference-Aware DNN Training · IEEE Trans. Parallel Distributed Syst. 2025
Memory systems › cache
prefetching
0.312025
PopFetcher: Towards Accelerated Mixture-of-Experts Training Via Popularity Based Expert-Wise Prefetch · USENIX ATC 2025

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

random forest · 1.7popularity-based scheduling · 1.7pipeline partition · 1.7expert-wise prefetch · 1.7asynchronous pipeline · 1.7
YearPublicationVenuePosition
2026 MAEDA: An LLM-Powered Multi-Agent Evaluation Framework for EDA Tool Documentation QA
abstract
Large Language Models (LLMs) have shown remarkable capability in knowledge-intensive scenarios, such as electronic design automation (EDA) tool documentation question answering (QA), due to their ability to process and generate contextually rich, domain-specific information. Evaluating LLM outputs is paramount, as it directly impacts their accuracy, effectiveness, and trustworthiness in practical applications. In this paper, we introduce MAEDA, a novel LLM-powered multi-agent evaluation framework that utilizes multiple fine-tuned LLM agents working collaboratively to assess common error types encountered in EDA tool documentation QA. Specifically, we design customized point-to-point alignment and chain-of-thought (CoT) reasoning strategies tailored to specific agents, enhancing both fine-tuning and inference capabilities. Experimental results demonstrate that MAEDA outperforms state-of-the-art (SOTA) general-purpose and cross-domain evaluation frameworks in accurately identifying error types specific to this domain. Our benchmark is publicly available at https://github.com/Rayzzz14/MAEDA-DATE26/.
Yuan Pu 0001, Hairuo Han, Yuntao Nie, Jiajun Qin, Yuhan Qin, Tairu Qiu, Zhuolun He, Jianwang Zhai, Bei Yu 0001
DATE4
2025 PopFetcher: Towards Accelerated Mixture-of-Experts Training Via Popularity Based Expert-Wise Prefetch
Chuanhu Ma, Xiong Wang 0006, Yuntao Nie, Yuqing Li 0001, Yuedong Xu 0001, Xiaofei Liao, Bo Li 0001, Hai Jin 0001
USENIX ATC4
2025 DynPipe: Toward Dynamic End-to-End Pipeline Parallelism for Interference-Aware DNN Training
abstract
Pipeline parallelism has emerged as an indispensable technique for training large deep neural networks. While existing asynchronous pipeline systems address the time bubbles inherent in synchronous architectures, they continue to suffer frominefficiencyandsusceptibilitytovolatilehardware environment due to their suboptimal andstaticconfigurations. In this paper, we propose DynPipe, aninterference-awareasynchronous pipeline framework to optimize theend-to-endtraining performance in highlydynamiccomputing environments. By characterizing thenon-overlappedcommunication overheads andconvergencerate conditioned on stage-wise staleness, DynPipe carefully crafts an optimized pipeline partition that harmonizes the hardware speed with statistical convergence. Moreover, DynPipe deploys anon-intrusiverandom forest model that utilizes runtime stage statistics to evaluate the impact of environmental changes, such as task interference and network jitter, on the training efficiency. Following the evaluation guidance, DynPipe adaptivelyadjustspartition plan to restore both intra and inter-stage load balancing, thereby facilitating seamless pipeline reconfiguration in dynamic environments. Extensive experiments show that DynPipe outperforms state-of-the-art systems, accelerating the time-to-accuracy by1.5-3.4×.
Zhengyi Yuan, Xiong Wang 0006, Yuntao Nie, Yufei Tao 0005, Yuqing Li 0001, Zhiyuan Shao, Xiaofei Liao, Bo Li 0001, Hai Jin 0001
IEEE Trans. Parallel Distributed Syst.3