Han Zhao

Han Zhao

Auto-generated profile, based on publicly available information

Han Zhao

Shanghai Jiao Tong University, Shanghai, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 April 2024
Verified
Conference Paper
Open access
CXChuhao Xu
Chuhao Xu
YLYiyu Liu
Yiyu Liu
ZLZijun Li
Zijun Li
QCQuan Chen
Quan Chen
HZHan Zhao
Han Zhao
MGMinyi Guo
Minyi Guo
In serverless computing, an idle container is not recycled directly, in order to mitigate time-consuming cold container startup. These idle containers still occupy the memory, exasperating the memory shortage of today's data centers. By offloading their cold memory to remote memory pool could potentially resolve this problem. However, existing offloading policies either hurt the Quality of Service (QoS) or are too coarse-grained in serverless computing scenarios. We therefore propose FaaSMem, a dedicated memory offloading mechanism tailored for serverless computing with memory poor architecture. It is proposed based on our finding that the memory of a serverless container allocated in different stages has different usage patterns. Specifically, FaaSMem proposes Page Bucket (Pucket) to segregate the memory pages in different segments, and applies segment-wise offloading policies for them. FaaSMem also proposes a semi-warm period during keep-alive stage, to seek a sweet spot between the offloading effort and the remote access penalty. Experimental results show that FaaSMem reduces the average local memory footprint by 9.9% - 79.8% and improves the container deployment density to 108% - 218%, with negligible 95%-ile latency increase.

30 March 2025
Verified
Conference Paper
Open access
SZShulai Zhang
Shulai Zhang
QCQuan Chen
Quan Chen
WCWeihao Cui
Weihao Cui
HZHan Zhao
Han Zhao
CXChunyu Xue
Chunyu Xue
MGMinyi Guo
Minyi Guo

20 November 2024 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
YFYu Feng
Yu Feng
WLWeikai Lin
Weikai Lin
ZLZihan Liu
Zihan Liu
JLJingwen Leng
Jingwen Leng
MGMinyi Guo
Minyi Guo
YZYuhao Zhu
Yuhao Zhu
Neural Radiance Field (NeRF) has emerged as a promising alternative for photorealistic rendering. Despite recent algorithmic advancements, achieving real-time performance on today’s resource-constrained devices remains challenging. In this article, we identify the primary bottlenecks in current NeRF algorithms and introduce a unified algorithm-architecture co-design, Potamoi , designed to accommodate various NeRF algorithms. Specifically, we introduce a runtime system featuring a plug-and-play algorithm, SpaRW , which significantly reduces the per-frame computational workload and alleviates compute inefficiencies. Furthermore, our unified streaming pipeline coupled with customized hardware support effectively tames both SRAM and DRAM inefficiencies by minimizing repetitive DRAM access and completely eliminating SRAM bank conflicts. When evaluated against a baseline utilizing a dedicated DNN accelerator, our framework demonstrates a speedup and energy reduction of 53.1× and 67.7×, respectively, all while maintaining high visual quality with less than a 1.0 dB reduction in peak signal-to-noise ratio.

10 August 2023 in IEEE Transactions on Computers
Verified
Journal Article
Open access
HZHan Zhao
Han Zhao
WCWeihao Cui
Weihao Cui
QCQuan Chen
Quan Chen
JLJingwen Leng
Jingwen Leng
DZDeze Zeng
Deze Zeng
MGMinyi Guo
Minyi Guo
While deep neural network (DNN) models are mainly trained using GPUs, many companies and research institutions build shared GPU clusters. These clusters host DNN training jobs, DNN inference jobs, and CPU jobs (jobs in traditional areas). DNN training jobs require GPU for main computation and CPU for auxiliary computation. Some DNN inference jobs could rely solely on CPU, while others must utilize both CPU and GPU. Our investigation demonstrates that the number of cores allocated to a training job significantly impacts its performance, and that DNN inference jobs can make use of the limited CPU cores on the GPU nodes. To accomplish this, we characterize representative deep learning models in terms of their CPU core requirements for their training jobs and inference jobs, and investigate their sensitivity to other CPU-side resource contention. Based on the characterization, we propose SODA, a scheduling system comprised of an adaptive CPU allocator, a multi-array job scheduler, a hardware-aware inference job placer, and a real-time contention eliminator. The experimental results indicate that SODA increases GPU utilization by an average of 19.9%, while maintaining the quality of service target for all DNN inference jobs and the queuing performance of CPU jobs.

30 October 2023
Verified
Conference Paper
Open access
BCBinghao Chen
Binghao Chen
HZHan Zhao
Han Zhao
WCWeihao Cui
Weihao Cui
YHYifu He
Yifu He
SZShulai Zhang
Shulai Zhang
MGMinyi Guo
Minyi Guo
Cloud vendors are now providing cloud gaming services with GPUs. GPUs in cloud gaming experience periods of idle because not every frame in a game always keeps the GPU busy for rendering. Previous works temporally co-locate games with best-effort applications to harvest these idle cycles. However, these works ignore the spatial sharing of GPUs, leading to not maximized throughput improvement. The newly introduced RT (ray tracing) Cores inside GPU SMs for ray tracing exacerbate the situation. This paper presents Combo, which efficiently leverages two-level spatial sharing: intra-SM and inter-SM sharing, for throughput improvement while guaranteeing the QoS of rendering games' frames. Combo is novel in two ways. First, based on the investigation of programming models for RT Cores, Combo devises a neat compilation method to convert the kernels that use RT Cores for fine-grained resource management. We utilize the fine-grained kernel management to construct spatial sharing schemes. Second, since the performance of spatial sharing varies with the actual co-located kernels, two efficient spatial sharing schemes are proposed: exact integrated SM sharing and relaxed intra-SM sharing. In order to maximize the throughput of BE applications, Combo identifies the best-fit scenarios for these two schemes by considering runtime rendering load. Our evaluation shows Combo can achieve up to 38.2% (14.0% on average) throughput improvement compared with the state-of-the-art temporal-only solution.

22 March 2026
Verified
Conference Paper
Open access
YCYukang Chen
Yukang Chen
WCWeihao Cui
Weihao Cui
HZHan Zhao
Han Zhao
ZXZiyi Xu
Ziyi Xu
XFXiaoze Fan
Xiaoze Fan
QCQuan Chen
Quan Chen