Chunpu Huang

Chunpu Huang

Auto-generated profile, based on publicly available information

Chunpu Huang

Fudan University, Shanghai, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
26 January 2026 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
PDF file
CHChunpu Huang
Chunpu Huang
YHYukai Huang
Yukai Huang
JFJingqi Feng
Jingqi Feng
SLSicheng Liang
Sicheng Liang
MYMing Yan
Ming Yan
JWJie Wu
Jie Wu
Serverless computing has become a transformative cloud paradigm due to its operational simplicity, cost efficiency, and elastic scalability. Unfortunately, it suffers from cold-start problems caused by container initialization during the first function invocation or after container reclamation. Container caching (i.e., keep-alive policies) is an effective and widely adopted solution to mitigate cold-starts. However, existing keep-alive policies rely on fixed time thresholds or static heuristics, making them inadequate to handle the dynamic and heterogeneous workloads. In this paper, we propose LACE, a learned container caching framework for resource management in serverless computing. Leveraging high-quality features and labels of irregular functions, LACE employs a Mixture-of-Experts (MoE) architecture to model dynamic function invocation patterns. It further incorporates a multi-task learning structure that combines regression for fine-grained interval prediction with auxiliary classification for coarse-grained pattern estimation. Evaluation on Azure workload traces shows that LACE outperforms the state-of-the-art keep-alive policy, reducing cold-start overhead and rate by 32.72% and 22.46%, respectively, while achieving container caching accuracy close to the optimal Belady policy, all without incurring excessive model decision delay or memory footprints.

17 May 2026 in Future Internet
Verified
Journal Article
Open access
PDF file
SLSicheng Liang
Sicheng Liang
CHChunpu Huang
Chunpu Huang
YLYexuan Li
Yexuan Li
ZWZhao Wang
Zhao Wang
BZBenhao Zhu
Benhao Zhu
JWJie Wu
Jie Wu
Multi-agent workflows have emerged as an important execution pattern for intelligent applications, where specialized agents collaborate through dependent stages such as planning, retrieval, execution, and verification. When such workflows are deployed over edge-cloud infrastructures, scheduling becomes challenging because task dependencies, heterogeneous resource conditions, and topology-dependent communication overhead must be considered jointly. We study the problem of scheduling multi-agent workflows in edge-cloud environments and propose a graph-aware scheduling method that models workflow execution as a task graph and the underlying infrastructure as a resource graph. The method combines structure-aware task and resource representations, communication-sensitive assignment scoring, and online resource-state updates to improve task placement quality. Experiments across different workflow complexities, system scales, and dynamic operating conditions show that the proposed method achieves a favorable balance among latency, communication overhead, and execution cost, particularly in communication-sensitive and medium-to-large-scale settings. These results suggest that jointly modeling workflow structure and resource topology can improve scheduling quality for multi-agent workflow execution in heterogeneous edge-cloud environments.

8 May 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
SLSicheng Liang
Sicheng Liang
YWYihao Wen
Yihao Wen
CHChunpu Huang
Chunpu Huang
YLYu Liu
Yu Liu
YNYichen Nie
Yichen Nie
JWJie Wu
Jie Wu
Multimodal Attributed Graphs (MAGs), which include textual, visual, and structural information, are prevalent in domains such as e-commerce and social media. However, zero-shot reasoning on MAGs remains challenging. Existing graph neural networks often produce biased representations due to modality imbalance and limited semantic reasoning, and their reliance on labeled data makes them almost incapable of handling such scenarios. Meanwhile, large language models (LLMs) exhibit strong cross-modal reasoning ability but lack explicit modeling of graph structure. To address these challenges, we propose CoMAG, a collaborative framework that unifies graph-enhanced multimodal representation learning with LLM-based reasoning. CoMAG extracts modality-specific embeddings via frozen encoders and refines them through self-supervised graph learning. It further derives discrete structural priors as symbolic tokens and aligns graph embeddings with the LLM token space, enabling prompt-based inference. Moreover, a structure-aware reasoning layer introduces gated structural cues, adaptive modality fusion, and neighborhood-consistent prediction to enhance robustness. Extensive experiments on multiple real-world MAG datasets for zero-shot tasks demonstrate the effectiveness of CoMAG, yielding consistent and notable improvements over state-of-the-art baselines. These results highlight CoMAG’s capability to tackle the fundamental challenges of zero-shot multimodal graph reasoning.

8 August 2026
Verified
Conference Paper
Open access
JFJingqi Feng
Jingqi Feng
GYGuang Yang
Guang Yang
YHYukai Huang
Yukai Huang
SLSicheng Liang
Sicheng Liang
CHChunpu Huang
Chunpu Huang
JWJie Wu
Jie Wu

18 August 2026 in Knowledge-Based Systems
Verified
Journal Article
Closed access
SLSicheng Liang
Sicheng Liang
YWYihao Wen
Yihao Wen
CHChunpu Huang
Chunpu Huang
YLYu Liu
Yu Liu
YNYichen Nie
Yichen Nie
JWJie Wu
Jie Wu

20 February 2025
Verified
Book Chapter
Closed access
PDF file
CHChunpu Huang
Chunpu Huang
YHYukai Huang
Yukai Huang
LCLulu Chen
Lulu Chen
RZRui Zhang
Rui Zhang
MYMing Yan
Ming Yan
JWJie Wu
Jie Wu