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

Yuanchi Liu

dblp:355/7486 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

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

Computer networks · 2 · 2 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
2 papers
Cloud and datacenter computing · 44% Hardware accelerators and domain-specific architectures · 25% Performance modeling and evaluation · 25%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › performance prediction
latency prediction
0.812024
LitePred: Transferable and Scalable Latency Prediction for Hardware-Aware Neural Architecture Search · NSDI 2024
Hardware accelerators and domain-specific architectures
neural architecture search
0.812024
LitePred: Transferable and Scalable Latency Prediction for Hardware-Aware Neural Architecture Search · NSDI 2024
Cloud and datacenter computing
cluster resource management and scheduling
0.712023
Dynamic Resource Allocation for Deep Learning Clusters with Separated Compute and Storage · INFOCOM 2023
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search
hardware-aware neural architecture search
0.212024
LitePred: Transferable and Scalable Latency Prediction for Hardware-Aware Neural Architecture Search · NSDI 2024
GPUs and heterogeneous computing › multi-GPU computing
GPU scaling
0.212023
Dynamic Resource Allocation for Deep Learning Clusters with Separated Compute and Storage · INFOCOM 2023

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

transfer learning · 1.5social welfare maximization · 0.7closed-form optimization · 0.7
YearPublicationVenuePosition
2024 LitePred: Transferable and Scalable Latency Prediction for Hardware-Aware Neural Architecture Search
Chengquan Feng, Li Lyna Zhang, Yuanchi Liu, Jiahang Xu, Chengruidong Zhang, Ting Cao 0003, Mao Yang 0004, Haisheng Tan
NSDI3
2023 Dynamic Resource Allocation for Deep Learning Clusters with Separated Compute and Storage
abstract
The separation of compute and storage in modern cloud services eases the deployment of general applications. However, with the development of accelerators such as GPU/TPU, Deep Learning (DL) training is suffering from potential IO bottlenecks when loading data from storage clusters. Therefore, DL training jobs need to either create local cache in the compute cluster to reduce the bandwidth demands or scale up the IO capacity with higher bandwidth cost. It is full of challenges to choose the best strategy due to the heterogeneous cache/IO preference of DL models, shared dataset among multiple jobs and dynamic GPU scaling of DL training. In this work, we exploit the job characteristics based on their training throughput, dataset size and scalability. For fixed GPU allocation of jobs, we propose CBA to minimize the training cost with a closed-form approach. For clusters that can automatically scale the GPU allocations of jobs, we extend CBA to AutoCBA to support diverse job utility functions and improve social welfare within a limited budget. Extensive experiments with production traces validate that CBA and AutoCBA can reduce IO cost and improve total social welfare by up to 20.5% and 2.27×, respectively, over the state-of-the-art schedulers for DL training.
Mingxia Li, Zhenhua Han, Chi Zhang 0043, Ruiting Zhou, Yuanchi Liu, Haisheng Tan
INFOCOM5