面向交叉微服务链的任务调度优化

doi:10.19665/j.issn1001-2400.2021.06.005

西安电子科技大学学报 ›› 2021, Vol. 48 ›› Issue (6): 32-39.doi: 10.19665/j.issn1001-2400.2021.06.005

• 智能嵌入式系统结构与软件关键技术专栏 • 上一篇下一篇

面向交叉微服务链的任务调度优化

张宇鹏(),吴自力(),陈鸣(),张璐璐()

西安电子科技大学计算机科学与技术学院,陕西西安 710071

收稿日期:2021-08-20 出版日期:2021-12-20 发布日期:2022-02-24
通讯作者: 吴自力
作者简介:张宇鹏(1984—),男,副研究员,硕士,E-mail: zhangyp@xidian.edu.cn|陈鸣(1998—),女,西安电子科技大学硕士研究生,E-mail: 19031211681@stu.xidian.edu.cn|张璐璐(1996—),女,西安电子科技大学硕士研究生,E-mail: 906657317@qq.com
基金资助:
国家自然科学基金(61972302);国家自然科学基金(61962019);陕西省重点研发计划(2019ZDLGY13-01);陕西省重点研发计划(2021GY-086);陕西省重点研发计划(2021ZDLGY07-01)

Optimization of task scheduling oriented to cross microservice chains

ZHANG Yupeng(),WU Zili(),CHEN Ming(),ZHANG Lulu()

School of Computer Science and Technology,Xidian University,Xi’an 710071,China

Received:2021-08-20 Online:2021-12-20 Published:2022-02-24
Contact: Zili WU

摘要/Abstract

摘要：

微服务架构将应用程序划分为一组松散耦合的细粒度服务,各个微服务独立部署更新。同时,这些微服务相互协作形成了多条存在交叉的微服务链,服务的交叉点成为资源竞争的关键位置。因此,合理地为服务分配资源,能有效地解决服务链交叉带来的资源竞争问题,从而提高任务调度过程中的资源利用率,降低了任务响应时间。然而现有的研究中往往忽视或简化了服务链交叉访问微服务时产生的冲突问题,导致系统调度效果差。为此,针对微服务链交叉产生的资源竞争问题,以系统资源利用率及处理请求的全局响应时间为衡量指标,将微服务架构中服务的资源消耗情况和任务执行的时间进行了形式化表征。同时,结合蚁群算法并行计算与模拟退火算法局部扰动的优势,提出了一种面向交叉微服务链的任务调度算法。通过实验证明,与先来先服务算法和传统蚁群算法相比,文中的算法能够在复杂微服务链环境下有效提高资源利用率,并降低任务的全局响应时间。

关键词: 微服务链, 多目标优化, 调度算法, 资源利用率

Abstract:

The microservice architecture arranges an application as a set of loosely-coupled fine-grained services,with each microservice independently deployed and updated.The cooperation of services leads to multiple intersecting microservice chains.And the intersection of microservices becomes a key position for resource competition.Therefore,rational allocation of microservices can improve resource utilization,reduce the task response time and solve the problem of resource competition caused by the intersection of microservice chains.However,existing research often ignores or simplifies the conflict problem caused by the intersection of microservice chains,resulting in poor system scheduling.Therefore,aiming at the above problem,this paper takes the resource utilization and the global response time as the measurement indicators to formally characterize the resource consumption of services and the task execution time in the microservice architecture.Combined with the advantages of parallel computing of the ant colony algorithm and local perturbations of simulated annealing algorithm,this paper proposes a chain-oriented task scheduling algorithm (COTSA).Experimental results show that compared with first come first service (FCFS) and ant colony optimization (ACO),the COTSA can effectively improve resource utilization and reduce the overall response time in the complex microservice environment.

Key words: microservice chains, multiobjective optimization, scheduling algorithms, resource utilization

中图分类号:

TP301

张宇鹏,吴自力,陈鸣,张璐璐. 面向交叉微服务链的任务调度优化[J]. 西安电子科技大学学报, 2021, 48(6): 32-39.

ZHANG Yupeng,WU Zili,CHEN Ming,ZHANG Lulu. Optimization of task scheduling oriented to cross microservice chains[J]. Journal of Xidian University, 2021, 48(6): 32-39.

图/表 6

图1

表1

表2

图2

图3

图4

参考文献 15

[1]	LEWIS J FOWLER M. Microservices:A Definition of this New Architectural Term (2014)[J/OL]. [2014-05-25]. https://www.martinfowler.com/articles/microservices.html .
[2]	THÖNES J. Microservices[J]. IEEESoftware, 2015, 32(1):113-116.
[3]	NEWMAN S. Building Microservices:Designing Fine-Grained Systems[M]. Sebastopol:O’ Reilly, 2015.
[4]	DAYA S, DUY N V, EATI K, et al. Microservices from Theory to Practice:Creating Applications in IBM Bluemix Using the Microservices Approach[M]. New York:IBM Redbooks, 2016.
[5]	HOFF T. Lessons Learned from Scaling Uber to 2000 Engineers,1000 Services,and 8000 Git Repositories (2016)[J/OL]. [2016-10-12]. http://highscalability.com/blog/2016/10/12/lessons-learned-from-scaling-uber-to-2000-engineers-1000-ser.html .
[6]	REN Z, WANG W, WU G, et al. Migrating Web Applications from Monolithic Structure to Microservices Architecture[C]// Proceedings of the Tenth Asia-Pacific Symposium on Internetware.New York:ACM, 2018:1-10.
[7]	BAO L, WU C, BU X, et al. Performance Modeling and Workflow Scheduling of Microservice-Based Applications in Clouds[J]. IEEE Transactions on Parallel and Distributed Systems, 2019, 30(9):2114-2129. doi: 10.1109/TPDS.71
[8]	KAUR K, DHAND T, KUMAR N, et al. Container-as-a-Service at the Edge:Trade-off between Energy Efficiency and Service Availability at Fog Nano Data Centers[J]. IEEE Wireless Communications, 2017, 24(3):48-56. doi: 10.1109/MWC.2017.1600427
[9]	PANDA S K, JANA P K. AMulti-Objective Task Scheduling Algorithm for Heterogeneous Multi-Cloud Environment[C]// 2015 International Conference on Electronic Design,Computer Networks & Automated Verification (EDCAV).Piscataway:IEEE, 2015:82-87.
[10]	王燕. 改进多目标进化算法的云工作流调度[J]. 西安电子科技大学学报, 2019, 46(1):130-136.
	WANG Yan. Enhanced Multi-Objective Evolutionary Algorithm for Workflow Scheduling on the Cloud Platform[J]. Journal of Xidian University, 2019, 46(1):130-136.
[11]	WANG S, DING Z, JIANGC J. Elastic Scheduling for Microservice Applications in Clouds[J]. IEEE Transactions on Parallel and Distributed Systems, 2021, 32(1):98-115. doi: 10.1109/TPDS.71
[12]	LIMÓN X, GUERRA-HERNÁNDEZ A, SÁNCHEZ-GARCÍA A J, et al. Saga MAS:A Software Framework for Distributed Transactions in the Microservice Architecture[C]// 2018 6th International Conference in Software Engineering Research and Innovation (CONISOFT).Piscataway:IEEE, 2018:50-58.
[13]	闫群民, 马瑞卿, 马永翔, 等. 一种自适应模拟退火粒子群优化算法[J]. 西安电子科技大学学报, 2021, 48(4):120-127.
	YAN Qunmin, MA Ruiqing, MA Yongxiang, et al. Adaptive Simulated Annealing Particle Swarm Optimization Algorithm[J]. Journal of Xidian University, 2021, 48(4):120-127.
[14]	STEINBRUNN M, MOERKOTTE G, KEMPER A. Heuristic and Randomized Optimization for the Join Ordering Problem[J]. The VLDB Journal, 1997, 6(3):191-208. doi: 10.1007/s007780050040
[15]	ALIBABA. Cluster-trace-v2018 (2019)[DS/OL]. [2019-01-01]. https://github.com/alibaba/clusterdata/blob/v2018/cluster-trace-v2018 .

m_i	C_consume(_i₎	R_resource(_i₎	N_request(_i₎	N_scale(_i₎
m₁	{m₄}	3.5	10	5
m₂	{m₄,m₁₁}	3.7	8	10
m₃	{m₁₂}	4.7	8	9

参数	数值
CLUSTER	50
蚂蚁数量K	20
迭代次数N	50
信息素消散系数ρ	0.5
初始信息素浓度η0	2 000
初始温度T/(°)	1 000
降温速率r	0.3
最低温度T_min/(°)	0

面向交叉微服务链的任务调度优化

Optimization of task scheduling oriented to cross microservice chains

RichHTML

PDF (PC)

赞

可视化

摘要/Abstract

引用本文

使用本文

图/表 6

参考文献 15

相关文章 15

Metrics

本文评价

推荐阅读 10

[1]	杜文占,余志勇,杨剑,姜海滨. 改进NSGA-II算法及监测天线部署优化研究[J]. 西安电子科技大学学报, 2021, 48(5): 239-248.
[2]	杨五四,陈莉,王毅,张茂省. 一种适应度排序的高维多目标粒子群优化算法[J]. 西安电子科技大学学报, 2021, 48(3): 78-84.
[3]	刘天宇,王翥. 一种多样性控制的多目标粒子群算法[J]. 西安电子科技大学学报, 2021, 48(3): 106-114.
[4]	王燕. 改进多目标进化算法的云工作流调度[J]. 西安电子科技大学学报, 2019, 46(1): 130-136.
[5]	韩亚敏;柴争义;李亚伦;朱思峰. 长尾群组推荐的免疫多目标优化实现[J]. 西安电子科技大学学报, 2018, 45(3): 109-116.
[6]	王丹青;李萍. 利用GEK代理模型的天线快速多目标优化设计[J]. 西安电子科技大学学报, 2018, 45(2): 129-134+165.
[7]	王爱民;刘永强;张婧;刘衍珩. WSNs中一种寻找最小工作节点集的覆盖算法[J]. 西安电子科技大学学报, 2016, 43(4): 141-146.
[8]	王明昭;王宇平;王晓丽;卫珍. 一种均匀聚集距离的改进NSGA-Ⅱ算法[J]. 西安电子科技大学学报, 2016, 43(3): 49-54+130.
[9]	雷雨;焦李成;公茂果;李玲玲. 求解多目标考试时间表问题的NNIA改进算法[J]. 西安电子科技大学学报, 2016, 43(2): 157-161+192.
[10]	齐小刚;陆赞赞;郑耿忠;孙二坤;胡明明;谢满德. 一种低能耗低时延的睡眠调度算法[J]. J4, 2015, 42(1): 124-129.
[11]	代才;王宇平;何晓光. 高维多目标问题的排序新方法[J]. J4, 2014, 41(6): 89-94.
[12]	徐琳;曲仕茹;鱼滨. ITSGrid资源调度策略的研究[J]. J4, 2014, 41(3): 203-208.
[13]	董宁;王宇平. 求解约束优化问题的偏好多目标进化算法[J]. J4, 2014, 41(1): 98-104+188.
[14]	张茂森;邱智亮;高雅;黎军. 星上Clos交换网络的逆向调度算法[J]. J4, 2013, 40(4): 96-101.
[15]	陈国强;王宇平. 分解多目标优化揭示复杂网络社区层次结构[J]. J4, 2013, 40(3): 205-211.