Lingxiao Jin

dblp:374/5084 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0003-5779-9407ORCID · reported

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

Systems, architecture and hardware · 2 · 2 first-author · 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 · 84% Storage systems · 12% Parallel and multicore computing · 4%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
serverless computing
1.722025
Ephemera: Accelerating I/O-Intensive Serverless Workloads with a Harvested In-memory File System · ACM Trans. Archit. Code Optim. 2025
AARC: Automated Affinity-aware Resource Configuration for Serverless Workflows · DAC 2025
Cloud and datacenter computing
cluster resource management and scheduling
0.912025
AARC: Automated Affinity-aware Resource Configuration for Serverless Workflows · DAC 2025
Cloud and datacenter computing › serverless computing
ephemeral storage
0.912025
Ephemera: Accelerating I/O-Intensive Serverless Workloads with a Harvested In-memory File System · ACM Trans. Archit. Code Optim. 2025
Storage systems
file systems
0.912025
Ephemera: Accelerating I/O-Intensive Serverless Workloads with a Harvested In-memory File System · ACM Trans. Archit. Code Optim. 2025
Cloud and datacenter computing › resource management
resource configuration
0.912025
AARC: Automated Affinity-aware Resource Configuration for Serverless Workflows · DAC 2025
Cloud and datacenter computing › serverless computing
serverless workflows
0.912025
AARC: Automated Affinity-aware Resource Configuration for Serverless Workflows · DAC 2025
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.312025
Ephemera: Accelerating I/O-Intensive Serverless Workloads with a Harvested In-memory File System · ACM Trans. Archit. Code Optim. 2025
Parallel and multicore computing › task scheduling › task graph scheduling
critical path scheduling
0.312025
AARC: Automated Affinity-aware Resource Configuration for Serverless Workflows · DAC 2025
Cloud and datacenter computing
workflow scheduling
0.312025
AARC: Automated Affinity-aware Resource Configuration for Serverless Workflows · DAC 2025
Cloud and datacenter computing › resource management › workload management
workload orchestration
0.312025
Ephemera: Accelerating I/O-Intensive Serverless Workloads with a Harvested In-memory File System · ACM Trans. Archit. Code Optim. 2025

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

workload balancing · 0.9priority scheduling · 0.9memory i/o integration · 0.9graph-centric scheduling · 0.9
YearPublicationVenuePosition
2025 AARC: Automated Affinity-aware Resource Configuration for Serverless Workflows
abstract
Serverless computing is increasingly adopted for its ability to manage complex, event-driven workloads without the need for infrastructure provisioning. However, traditional resource allocation in serverless platforms couples CPU and memory, which may not be optimal for all functions. Existing decoupling approaches, while offering some flexibility, are not designed to handle the vast configuration space and complexity of serverless workflows. In this paper, we propose AARC, an innovative, automated framework that decouples CPU and memory resources to provide more flexible and efficient provisioning for serverless workloads. AARC is composed of two key components: Graph-Centric Scheduler, which identifies critical paths in workflows, and Priority Configurator, which applies priority scheduling techniques to optimize resource allocation. Our experimental evaluation demonstrates that AARC achieves substantial improvements over state-of-the-art methods, with total search time reductions of $85.8 \%$ and $89.6 \%$, and cost savings of $49.6 \%$ and $61.7 \%$, respectively, while maintaining SLO compliance.
Lingxiao Jin, Zinuo Cai, Ruhui Ma
DAC1
2025 Ephemera: Accelerating I/O-Intensive Serverless Workloads with a Harvested In-memory File System
abstract
Serverless computing has gained popularity for its ability to shift the burden of server management from developers to cloud providers, which allows providers to exercise greater control over resource management, optimizing configurations to enhance efficiency and performance. The diversity of serverless computing tasks, from short-lived, event-driven tasks to more complex workloads, highlights the growing importance of efficient file I/O performance for I/O-intensive workloads, yet effectively handling ephemeral storage for I/O-intensive tasks remains a challenge. Traditional file system approaches often introduce substantial latency and fail to fully leverage available memory resources within the execution environment, limiting performance and efficiency. Our work stems from the observation of the under-utilization of memory resources in serverless computing platforms and the potential efficiency improvement of I/O operations using an in-memory file system. Based on this observation, we propose Ephemera , a system designed to enhance ephemeral storage efficiency and memory utilization. Ephemera satisfies three design goals: transparent memory I/O integration , heterogeneous tasks resource synergy , and harmonized cluster workload orchestration . Ephemera integrates three components: the Runtime Daemon, responsible for managing a container’s in-memory file system; the Tenant Manager, facilitating memory configuration sharing across containers; and the Cluster Controller, optimizing workload balancing. Our experiments demonstrate that Ephemera significantly improves performance for I/O-intensive tasks compared to traditional file systems. Specifically, Ephemera decreases I/O processing time by 50% on average and reduces latency by up to 95.73% in certain scenarios with negligible overhead.
Lingxiao Jin, Zinuo Cai, Haoxin Wang 0005, Zongpu Zhang, Ruhui Ma, Haibing Guan, Yuan Liu 0021, Rajkumar Buyya
ACM Trans. Archit. Code Optim.1