An In-Depth Study of Microservice Call Graph and Runtime Performance

• Published in: IEEE transactions on parallel and distributed systems Vol. 33; no. 12; pp. 3901 - 3914
• Main Authors: Luo, Shutian, Xu, Huanle, Lu, Chengzhi, Ye, Kejiang, Xu, Guoyao, Zhang, Liping, He, Jian, Xu, Chengzhong
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.12.2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Containers; Graphs; Interference; Memory management; microservice; Microservice architectures; performance characterization; Production; Resource management; Runtime; Topology; Trace analysis; Weight reduction
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2022.3174631

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 also discover that the structure of call graphs for long-term developed applications is much simpler so as to provide better performance. Our investigation on microservice runtime performance indicates most microservices are much more sensitive to CPU interference than memory interference. Moreover, we design resource management policies to efficiently tune memory resources.