Lin Zhong

Lin Zhong

Auto-generated profile, based on publicly available information

Lin Zhong

Yale University, New Haven, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications

12 October 2025
Verified
Conference Paper
Open access
IGIn Gim
In Gim
ZMZhiyao Ma
Zhiyao Ma
SLSeung-Seob Lee
Seung-Seob Lee
LZLin Zhong
Lin Zhong

23 October 2023
Verified
Conference Paper
Open access
ZMZhiyao Ma
Zhiyao Ma
GCGuojun Chen
Guojun Chen
LZLin Zhong
Lin Zhong
Stack unwinding is a well-established approach for handling panics in Rust programs. However, its feasibility on resource-constrained embedded systems has been unclear due to the associated overhead and complexity. This paper presents our experience of implementing stack unwinding and panic recovery within a Rust-based soft real-time embedded operating system. We describe several novel optimizations that help achieve adequate performance for a flying drone with a CPU overhead of 2.6% and a storage overhead of 26.0% to recover from panics in application tasks and interrupt handlers.

23 June 2025
Verified
Conference Paper
Open access
ZMZhiyao Ma
Zhiyao Ma
GCGuojun Chen
Guojun Chen
ZCZhuo Chen
Zhuo Chen
LZLin Zhong
Lin Zhong

26 February 2025
Verified
Conference Paper
Open access
PAParthiban Annamalai
Parthiban Annamalai
MKMinsung Kim
Minsung Kim
AKAnurag Khandelwal
Anurag Khandelwal
LZLin Zhong
Lin Zhong
The computational load in a Virtualized Radio Access Network (vRAN) varies rapidly and massive Multiple-Input Multiple-Output (MIMO) makes it even more dynamic. Existing massive MIMO vRAN systems commonly adopt static resource provisioning and thus often result in either under- or over-provisioning of compute resources. In this paper, we explore the feasibility of a Dynamic Resource Provisioning (DRP) in a massive MIMO vRAN to dynamically allocate Central Processing Unit (CPU) cores for varying computational loads. We investigate a Reinforcement Learning (RL)-based DRP algorithm that provisions optimal number CPU cores in an automated manner. To experimentally demonstrate its viability, we integrate our RL-based DRP into a real-time fully-software massive MIMO vRAN prototype system. Our early experimental results, however, do not show any significant advantage of an RL-based solution over a simple Steepest Gradient Descent (SGD)-based DRP. We believe that this surprising result is largely due to the fact that current open-source vRAN systems cannot sufficiently reflect the highly complex nature of the real vRAN. We further discuss the way ahead, challenges, and opportunities in this research direction.

23 October 2023
Verified
Conference Paper
Open access
RIRamla Ijaz
Ramla Ijaz
KBKevin Boos
Kevin Boos
LZLin Zhong
Lin Zhong