The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Characterizing Microservice Dependency and Performance: Alibaba Trace Analysis
Abstract
Loosely-coupled and light-weight microservices running in containers are replacing monolithic applications gradually. Understanding the characteristics of microservices is critical to make good use of microservice architectures. However, there is no comprehensive study about microservice and its related systems in production environments so far. In this paper, we present a solid analysis of large-scale deployments of microservices at Alibaba clusters. Our study focuses on the characterization of microservice dependency as well as its runtime performance. We conduct an in-depth anatomy of microservice call graphs to quantify the difference between them and traditional DAGs of data-parallel jobs. In particular, we observe that microservice call graphs are heavy-tail distributed and their topology is similar to a tree and moreover, many microservices are hot-spots. We reveal three types of meaningful call dependency that can be utilized to optimize microservice designs. Our investigation on microservice runtime performance indicates most microservices are much more sensitive to CPU interference than memory interference. To synthesize more representative microservice traces, we build a mathematical model to simulate call graphs. Experimental results demonstrate our model can well preserve those graph properties observed from Alibaba traces.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing
Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J. H., McCauley, M., Franklin, M. J. M., Shenker, S. J., & Stoica, I. G. (2012) · UC Berkeley · Cited by 4,891
Benchmarking cloud serving systems with YCSB
Cooper, B. F., Silberstein, A., Tam, E., Ramakrishnan, R., & Sears, R. (2010) · Proceedings of the 1st ACM symposium on Cloud computing · doi:10.1145/1807128.1807152 · Cited by 3,716
Distributed Systems: Principles and Paradigms
Tanenbaum, A. S., & van Steen, M. R. (2001) · Cited by 2,189
Vishwanathan, S. V. N., Schraudolph, N. N., Kondor, R., & Borgwardt, K. M. (2010) · CaltechAUTHORS (California Institute of Technology) · Cited by 1,305
(2015) · KTH Publication Database DiVA (KTH Royal Institute of Technology) · Cited by 1,144
Heterogeneity and dynamicity of clouds at scale: Google trace analysis
Reiss, C., Tumanov, A., Ganger, G. R., Katz, R. H., & Kozuch, M. A. (2012) · Proceedings of the Third ACM Symposium on Cloud Computing · doi:10.1145/2391229.2391236 · Cited by 1,063
Dapper, a Large-Scale Distributed Systems Tracing Infrastructure
Sigelman, B. H., Barroso, L. A., Burrows, M., Stephenson, P., Plakal, M., Beaver, D., Jaspan, S., & Shanbhag, C. (2010) · Cited by 899
Gan, Y., Zhang, Y., Cheng, D., Shetty, A., Rathi, P., Katarki, N., Bruno, A., Hu, J., Ritchken, B., Jackson, B., et al. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304013 · Cited by 665
Cortez, E., Bonde, A., Muzio, A., Russinovich, M., Fontoura, M., & Bianchini, R. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132772 · Cited by 633
Cited by
Eadro: An End-to-End Troubleshooting Framework for Microservices on Multi-source Data
Lee, C., Yang, T., Chen, Z., Su, Y., & Lyu, M. R. (2023) · 2023 IEEE/ACM 45th International Conference on Software Engineering (ICSE) · doi:10.1109/icse48619.2023.00150 · Cited by 149
“Microservice systems are increasingly appealing to cloud-native enterprise applications for several reasons, including resource flexibility, loosely-coupled architecture, and lightweight deployment [1].”
A systematic review on effective energy utilization management strategies in cloud data centers
Panwar, S. S., Rauthan, M. M. S., & Barthwal, V. (2022) · Journal of Cloud Computing · doi:10.1186/s13677-022-00368-5 · Cited by 65
HeMiRCA: fine-grained root cause analysis for microservices with heterogeneous data sources
Zhu, Z., Lee, C., Tang, X., & He, P. (2024) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3674726 · Cited by 26
“Microservice architecture allows the cloud-native enterprise to develop an application as a suite of small, independent, and loosely coupled services that can be developed, tested, and deployed separately [36].”
Background(2024) · doi:10.1145/3597503.3639088 · Cited by 22
MRCA: metric-level root cause analysis for microservices via multi-modal data
Wang, Y., Zhu, Z., Fu, Q., Ma, Y., & He, P. (2024) · Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering · doi:10.1145/3691620.3695485 · Cited by 18
“Nowadays, microservice systems have become the first choice for large-scale system design [8, 29].”
Holistic Root Cause Analysis for Failures in Cloud-Native Systems Through Observability Data
Han, Y., Du, Q., Huang, Y., Li, P., Shi, X., Wu, J., Fang, P., Tian, F., & He, C. (2024) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2024.3478759 · Cited by 16
“L OOSELY-COUPLED and lightweight microservice applications have become the de facto standard for delivering core business in large IT enterprises [1], [2].”
Zhang, X., Wang, Q., Li, M., Yuan, Y., Xiao, M., Zhuang, F., & Yu, D. (2025) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2025.3629066 · Cited by 15
Efficient and Robust Trace Anomaly Detection for Large-Scale Microservice Systems
Zhang, S., Pan, Z., Liu, H., Jin, P., Sun, Y., Ouyang, Q., Wang, J., Jia, X., Zhang, Y., Yang, H., et al. (2023) · 2023 IEEE 34th International Symposium on Software Reliability Engineering (ISSRE) · doi:10.1109/issre59848.2023.00012 · Cited by 14
Metadata
- Authors
- Luo, S., Xu, H., Lu, C., Ye, K., Xu, G., Zhang, L., Ding, Y., He, J., & Xu, C.
- Venue
- Proceedings of the ACM Symposium on Cloud Computing
- Publisher
- ACM
- Published
- 2021-11
- Pages
- 412-426
- OpenAlex
- W3209366914
- Cited by
- 293
- References
- 29
- FWCI
- 39.12
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.