Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fanrong Du

dblp:395/7108 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0005-6895-362XORCID · reported

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

Systems, architecture and hardware · 2 · 1 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
1 paper
Cloud and datacenter computing · 100%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%

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

TopicWeightPapersLastEvidence papers
Services computing and microservices › microservice architecture
microservice resource management
1.012026
Delphinus: Improving Resource Efficiency of Applications with Shared Microservices and Diverse Queries · ACM Trans. Archit. Code Optim. 2026
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
1.012026
Delphinus: Improving Resource Efficiency of Applications with Shared Microservices and Diverse Queries · ACM Trans. Archit. Code Optim. 2026
Cloud and datacenter computing › job scheduling
query scheduling
1.012026
Delphinus: Improving Resource Efficiency of Applications with Shared Microservices and Diverse Queries · ACM Trans. Archit. Code Optim. 2026
Cloud and datacenter computing
quality of service
0.312026
Delphinus: Improving Resource Efficiency of Applications with Shared Microservices and Diverse Queries · ACM Trans. Archit. Code Optim. 2026

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

load adaptation · 2.0container scheduling · 2.0
YearPublicationVenuePosition
2026 Delphinus: Improving Resource Efficiency of Applications with Shared Microservices and Diverse Queries
abstract
Microservices are widely shared in production user-facing applications. These shared microservices have various resource usage patterns when queries from different call graphs of different services access them. However, existing microservice management works fail to efficiently scale resources for them, mainly due to the lack of fine-grained scheduling of diverse queries. We therefore propose Delphinus , a runtime system that efficiently manages resources for shared microservices while ensuring the Quality-of-Service (QoS). Delphinus comprises a group-oriented query scheduler and a borrowing-based load adapter . The query scheduler identifies diverse queries, groups the containers of shared microservices, and schedules the queries into separate groups. The load adapter efficiently scales resources for shared microservices, and fully utilizes the idle containers among groups when the loads of diverse queries change. Results show that Delphinus reduces CPU and memory usage by 40.1% and 36.4% for shared microservices, respectively, compared to state-of-the-art works.
Jiuchen Shi, Jinyuan Chen, Quan Chen 0002, Kaihua Fu, Fanrong Du, Zijun Li 0001, Deze Zeng, Jiannong Cao 0001, Shuo Quan, Jie Wu 0001, Minyi Guo
ACM Trans. Archit. Code Optim.5
2025 Generating Microservice Graphs with Production Characteristics for Efficient Resource Scaling
abstract
A production microservice application can have multiple services with varying call graphs, and a microservice may be shared across different call graphs.Improving resource efficiency in such complex applications requires proper benchmarks, but production traces are often too large to be used in experiments.To this end, we propose a Service Dependency Graph Generator (DGG) that comprises a Data Handler and a Graph Generator, to generate service dependency graphs of benchmarks that incorporate production-level characteristics from traces.The data handler constructs fine-grained call graphs with dynamic interface and repeated calling features from the trace, and then clusters these call graphs based on the topological and invocation types.The graph generator uses a random graph model to simulate real microservice invocations, generating multiple call graphs and merging them into small-scale service dependency graphs with production-level characteristics.Case studies show that * Fanrong Du and Jiuchen Shi contributed equally to this work.
Fanrong Du, Jiuchen Shi, Quan Chen 0002, Pu Pang, Li Li 0012, Minyi Guo
ICS1