Jinlei Jiang

Jinlei Jiang

Auto-generated profile, based on publicly available information

Jinlei Jiang

Tsinghua University, Beijing, China

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
23 October 2023
Verified
Conference Paper
Open access
MZMingxing Zhang
Mingxing Zhang
TMTeng Ma
Teng Ma
JHJinqi Hua
Jinqi Hua
ZLZheng Liu
Zheng Liu
KCKang Chen
Kang Chen
YWYongwei Wu
Yongwei Wu

4 November 2024
Verified
Conference Paper
Open access
JHJialiang Huang
Jialiang Huang
MZMingXing Zhang
MingXing Zhang
TMTeng Ma
Teng Ma
ZLZheng Liu
Zheng Liu
SLSixing Lin
Sixing Lin
YWYongWei Wu
YongWei Wu
Serverless computing is renowned for its computation elasticity, yet its full potential is often constrained by the requirement for functions to operate within local and dedicated background environments, resulting in limited memory elasticity. To address this limitation, this paper introduces TrEnv, a co-designed integration of the serverless platform with the operating system and CXL/RDMA-based remote memory pools in two key areas. Firstly, TrEnv introduces repurposable sandboxes, which can be shared across different functions and hence, substantially decrease the overhead associated with creating isolation sandboxes. Secondly, it augments the OS with "memory templates" that enable rapid restoration of function states stored on remote memory. These innovations allow TrEnv to facilitate rapid transitions between instances of different functions and enable memory sharing across multiple nodes. Our evaluations using a variety of representative and real-world workloads demonstrate that TrEnv can initiate a container within 10 milliseconds, achieving up to a 7× speedup in P99 end-to-end latency and reducing memory usage by 48% on average compared to state-of-the-art on-demand restoring systems.

8 May 2023
Verified
Conference Paper
Open access
CHChengying Huan
Chengying Huan
SSShuaiwen Leon Song
Shuaiwen Leon Song
SPSantosh Pandey
Santosh Pandey
HLHang Liu
Hang Liu
Yongchao LiuYongchao Liu
Yongchao Liu
YWYongwei Wu
Yongwei Wu
Many real-world graphs are temporal in nature, where the temporal information indicates when a particular edge is changed (e.g., edge insertion and deletion). Performing random walks on such temporal graphs is of paramount value. The state-of-the-art sampling strategies are tailored for conventional static graphs and thus cannot effectively tackle the dynamic nature of temporal graphs due to several significant efficiency challenges, i.e., high sampling complexity, gigantic index space, and poor programmability. In this paper, we present TEA, the first highly-efficient general-purpose TEmporal grAph random walk engine. At its core, TEA introduces a new hybrid sampling approach that combines two Monte Carlo sampling methods together to drastically reduce space complexity and achieve high sampling speed. TEA further employs a series of algorithmic and system-level optimizations to remarkably improve the sampling efficiency, as well as provide streaming graph support. Finally, we introduce a temporal-centric programming model to ease the implementation of various random walk algorithms on temporal graphs. Experimental results demonstrate that TEA can achieve up to 3 orders of magnitude speedups over the state-of-the-art random walk engines on large temporal graphs.

10 April 2024
Verified
Conference Paper
Open access
WXWeiyu Xie
Weiyu Xie
MZMingXing Zhang
MingXing Zhang
XLXia Liao
Xia Liao
KCKang Chen
Kang Chen
JJJinlei Jiang
Jinlei Jiang
YWYongWei Wu
YongWei Wu

4 December 2025 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
ZGZhengyan Guo
Zhengyan Guo
MZMingxing Zhang
Mingxing Zhang
YSYingdi Shan
Yingdi Shan
KCKang Chen
Kang Chen
JJJinlei Jiang
Jinlei Jiang
YWYongwei Wu
Yongwei Wu
Modern stream processing engines (SPEs) must handle massive real-time data streams under strict latency and throughput requirements. However, conventional SPEs are constrained by their software parallelization strategies (e.g., queue-based data re-partitioning, high synchronization overheads, etc.), which prevent efficient utilization of modern hardware capabilities, ultimately limiting performance scalability. In this paper, we present FlexStream, a novel SPE that leverages hardware offloading to redesign the parallelization strategies and overcome these limitations. By offloading data re-partitioning to hardware and integrating a coupled network-executor model, FlexStream maximizes resource utilization, achieving up to 95% network bandwidth saturation. To address the load imbalance challenges introduced by this design, we implement a lock-free state backend with efficient state migration mechanisms. Overall, FlexStream achieves throughput improvements of 1.95 × - 3.35 × compared to state-of-the-art SPEs (e.g., LightSaber) across six real-world streaming analytics applications. FlexStream cuts latency spikes by 71.9% and migration time by 66.8% during state migration, highlighting the benefits of hardware-software co-design in SPEs. Our work underscores the potential of hardware-software co-design in SPEs, offering a scalable, elastic solution for real-time analytics.

28 March 2026 in ACM Transactions on Computer Systems
Verified
Journal Article
Open access
JHJialiang Huang
Jialiang Huang
TMTeng Ma
Teng Ma
ZLZheng Liu
Zheng Liu
SLSixing Lin
Sixing Lin
KCKang Chen
Kang Chen
MZMingxing Zhang
Mingxing Zhang
Serverless computing is renowned for its computation elasticity, yet its full potential is often constrained by the requirement for functions to operate within local and dedicated background environments, resulting in limited memory elasticity. To address this limitation, this paper introduces TrEnv-X , a co-designed integration of the serverless platform with the operating system and CXL/RDMA-based remote memory pools. TrEnv-X ’s core innovations are repurposable sandboxes, which can be shared across different functions to decrease the associated creation overhead, and OS-level memory templates, which enable rapid state restoration from CXL/RDMA-based remote memory pools. To further demonstrate TrEnv-X ’s versatility, we generalize its design from traditional containers for microVM-based agent workloads and introduce new optimizations, including browser sharing and a page cache bypassing mechanism. Our evaluation shows that TrEnv-X achieves up to 7 × reduction in P99 latency and 48% memory savings for container-based functions. When applied to LLM agents, it reduces the P99 latency by up to 58% and memory usage by 61% compared to state-of-the-art systems like E2B.