Multi-Granularity Decomposition based Task Scheduling for Migration Cost Minimization

Ziliang Wang, Tingting Zhang, Y. Li, Sheng Wang, F. Zhou, Lei Feng, Wenjing Li
{"title":"Multi-Granularity Decomposition based Task Scheduling for Migration Cost Minimization","authors":"Ziliang Wang, Tingting Zhang, Y. Li, Sheng Wang, F. Zhou, Lei Feng, Wenjing Li","doi":"10.1109/icss55994.2022.00026","DOIUrl":null,"url":null,"abstract":"With the development of mobile communication, network technology, and the continuous emergence of intelligent network applications, users' demand for network computing power has increased explosively, which promoted the formation of a multi-level computing power system composed of the end devices, mobile network edge cloud, and center clouds. The terminal and edge computing power resources are limited. The cloud computing power is rich, but the delay is high, so the computing power at all levels needs effective cooperation to meet the quality of service requirements of various ubiquitous computing services. In this trend, cloud computing and edge computing begin to evolve into networked collaborative computing. In this paper, a task scheduling heuristic algorithm based on task cost minimization is proposed for network computing services with a large amount of communication and computation and high delay cost. This method divides the computing tasks of network applications into multiple granularities and schedules the divided sub-tasks, which can improve the utilization of the distributed computing resources and enhance the collaborative scheduling capability of computing and network resources.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Service Science (ICSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icss55994.2022.00026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the development of mobile communication, network technology, and the continuous emergence of intelligent network applications, users' demand for network computing power has increased explosively, which promoted the formation of a multi-level computing power system composed of the end devices, mobile network edge cloud, and center clouds. The terminal and edge computing power resources are limited. The cloud computing power is rich, but the delay is high, so the computing power at all levels needs effective cooperation to meet the quality of service requirements of various ubiquitous computing services. In this trend, cloud computing and edge computing begin to evolve into networked collaborative computing. In this paper, a task scheduling heuristic algorithm based on task cost minimization is proposed for network computing services with a large amount of communication and computation and high delay cost. This method divides the computing tasks of network applications into multiple granularities and schedules the divided sub-tasks, which can improve the utilization of the distributed computing resources and enhance the collaborative scheduling capability of computing and network resources.
基于多粒度分解的迁移成本最小化任务调度
随着移动通信、网络技术的发展,以及智能网络应用的不断涌现,用户对网络计算能力的需求呈爆炸式增长,推动了由终端设备、移动网络边缘云和中心云组成的多层次计算能力体系的形成。终端和边缘计算能力资源有限。云计算能力丰富,但时延高,需要各级计算能力的有效协同,才能满足各种普适计算服务的服务质量要求。在这种趋势下,云计算和边缘计算开始向网络化协同计算发展。针对通信量大、计算量大、时延代价高的网络计算业务,提出了一种基于任务代价最小化的任务调度启发式算法。该方法将网络应用的计算任务划分为多个粒度,并对划分的子任务进行调度,提高了分布式计算资源的利用率,增强了计算资源和网络资源的协同调度能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信