Demo Data from EDBT 2026 / reviewers in the wild / expert
Haoxin Wang 0005
dblp:203/0135-5
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0000-9360-6084ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 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
1 paper |
Cloud and datacenter computing · 72% Storage systems · 28% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cloud and datacenter computing › serverless computing
ephemeral storage |
0.9 | 1 | 2025 | 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.9 | 1 | 2025 | Ephemera: Accelerating I/O-Intensive Serverless Workloads with a Harvested In-memory File System · ACM Trans. Archit. Code Optim. 2025 |
Cloud and datacenter computing
serverless computing |
0.9 | 1 | 2025 | Ephemera: Accelerating I/O-Intensive Serverless Workloads with a Harvested In-memory File System · ACM Trans. Archit. Code Optim. 2025 |
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management |
0.3 | 1 | 2025 | 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 › workload management
workload orchestration |
0.3 | 1 | 2025 | 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.9memory i/o integration · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Ephemera: Accelerating I/O-Intensive Serverless Workloads with a Harvested In-memory File SystemabstractServerless 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. | 3 |
| 2024 | SLoB: Suboptimal Load Balancing Scheduling in Local Heterogeneous GPU Clusters for Large Language Model InferenceabstractLarge language models (LLMs) are becoming powerful engines for social productivity in the manufacturing lifecycle. Existing application-level LLMs inference services focus on large datacenter and small edge intelligence (EI) scenarios, adopting iteration-level batch schedulers to solve resource utilization and inference speed problems. However, these services are incompatible with the scene of medium-sized local heterogeneous graphics processing unit (GPU) clusters with specific patterns, whose scale is between the two aforementioned scenarios. This type of scene proposes tradeoff problems for inference resource and speed, as well as user satisfaction problems for the semisparse frequency of queries with streaming responses. We propose suboptimal load balancing (SLoB), a distributed LLMs inference service scheduler in medium-sized local heterogeneous GPU clusters. SLoB leverages a multilevel adapter to accommodate LLMs usage patterns of scenes and balance resource utilization with inference efficiency. For semisparse problems, it adopts a mixed-priority pipeline scheduler with the least-padding principle to improve users’ satisfaction, a metric considering the weights of different tokens in streaming responses. Based on the system prototype, our experiments under simulated workloads demonstrate that SLoB gains a maximum improvement of 29.4$\times$under the satisfaction metric compared with the traditional run-to-completion scheduling solution while improving by up to 3.0$\times$compared with the state-of-the-art (SOTA) solution Orca. Peiwen Jiang, Haoxin Wang 0005, Zinuo Cai, Lintao Gao, Weishan Zhang, Ruhui Ma, Xiaokang Zhou |
IEEE Trans. Comput. Soc. Syst. | 2 |