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 inv...

Full description

Saved in:
Bibliographic Details
Published in:IOP conference series. Materials Science and Engineering Vol. 490; no. 4; pp. 42048 - 42053
Main Authors: Xu, Yan, Shang, Yanlei
Format: Journal Article
Language:English
Published: Bristol IOP Publishing 01.04.2019
Subjects:
Algorithms
Cloud computing
Concurrency
Priority scheduling
ISSN:1757-8981, 1757-899X, 1757-899X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1757-8981
1757-899X
1757-899X
DOI:10.1088/1757-899X/490/4/042048