Dynamic Priority based Weighted Scheduling Algorithm in Microservice System

With the development of cloud computing and container virtualization, the microservice architecture has received more and more attention. While microservices bring many benefits, they also bring some challenges. A user's request may require multiple microservices to collaborate, and chained invocations between microservices result in higher latency than a monolithic architecture. In this paper, we propose a dynamic priority based weighted scheduling algorithm for the problem that the latency of chained-service requests is too long in the case of high concurrency. Experiments show that the algorithm can reduce the latency of chained-service requests effectively in the case of little impact on the latency of leaf-service requests.