面向工业云边缘协作的流计算两阶段调度

Tiejun Wang, Xudong Mou, Juntao Hu, Rui Wang, Tianyu Wo
{"title":"面向工业云边缘协作的流计算两阶段调度","authors":"Tiejun Wang, Xudong Mou, Juntao Hu, Rui Wang, Tianyu Wo","doi":"10.1109/JCC56315.2022.00016","DOIUrl":null,"url":null,"abstract":"As the Industrial Internet of Things (IIoT) develops, intelligent services applying stream computing, such as industrial robot health management, are requiring higher timeliness of data processing, which may involve scheduling of stream tasks. However, traditional scheduling methods are no longer suitable for the currently widely used cloud-edge collaboration mode, not considering the cloud-edge heterogeneity, and focusing on the scheduling of single tasks instead of the optimization of the total tasks. To improve the performance of the cloud-edge collaboration, this paper establishes a practical model for task scheduling considering respectively cloud-edge environment collaboration models. We propose a novel two-stage scheduling method for IIoT. The algorithm utilizes the idea of maximum flow to divide the task into cloud-edge deployment schemes and find the best partitioning scheme, and then deploy the operator for the edge domain based on the network topology by using dynamic programming. Experimental results show that the proposed method could reduce 7.27% the cloud-edge bandwidth usage compared with the highest greedy algorithm for traffic difference, 24.33% end-to-end latency and 11.18% back-pressure rate compared with SBON.","PeriodicalId":239996,"journal":{"name":"2022 IEEE International Conference on Joint Cloud Computing (JCC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Two-stage Scheduling of Stream Computing for Industrial Cloud-edge Collaboration\",\"authors\":\"Tiejun Wang, Xudong Mou, Juntao Hu, Rui Wang, Tianyu Wo\",\"doi\":\"10.1109/JCC56315.2022.00016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As the Industrial Internet of Things (IIoT) develops, intelligent services applying stream computing, such as industrial robot health management, are requiring higher timeliness of data processing, which may involve scheduling of stream tasks. However, traditional scheduling methods are no longer suitable for the currently widely used cloud-edge collaboration mode, not considering the cloud-edge heterogeneity, and focusing on the scheduling of single tasks instead of the optimization of the total tasks. To improve the performance of the cloud-edge collaboration, this paper establishes a practical model for task scheduling considering respectively cloud-edge environment collaboration models. We propose a novel two-stage scheduling method for IIoT. The algorithm utilizes the idea of maximum flow to divide the task into cloud-edge deployment schemes and find the best partitioning scheme, and then deploy the operator for the edge domain based on the network topology by using dynamic programming. Experimental results show that the proposed method could reduce 7.27% the cloud-edge bandwidth usage compared with the highest greedy algorithm for traffic difference, 24.33% end-to-end latency and 11.18% back-pressure rate compared with SBON.\",\"PeriodicalId\":239996,\"journal\":{\"name\":\"2022 IEEE International Conference on Joint Cloud Computing (JCC)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Conference on Joint Cloud Computing (JCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCC56315.2022.00016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Joint Cloud Computing (JCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCC56315.2022.00016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着工业物联网(IIoT)的发展,工业机器人健康管理等应用流计算的智能服务对数据处理的时效性提出了更高的要求,这可能涉及到流任务的调度。然而,传统的调度方法已经不适合目前广泛使用的云边缘协作模式,不考虑云边缘的异构性,关注单个任务的调度而不是整体任务的优化。为了提高云边缘协作的性能,本文分别考虑不同的云边缘环境协作模型,建立了一个实用的任务调度模型。提出了一种新的工业物联网两阶段调度方法。该算法利用最大流量的思想,将任务划分为云边缘部署方案,寻找最佳的划分方案,然后利用动态规划的方法,根据网络拓扑对边缘域进行算子部署。实验结果表明,与最高贪婪算法相比,该方法可将云边缘带宽利用率降低7.27%,将端到端延迟降低24.33%,将背压率降低11.18%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Two-stage Scheduling of Stream Computing for Industrial Cloud-edge Collaboration
As the Industrial Internet of Things (IIoT) develops, intelligent services applying stream computing, such as industrial robot health management, are requiring higher timeliness of data processing, which may involve scheduling of stream tasks. However, traditional scheduling methods are no longer suitable for the currently widely used cloud-edge collaboration mode, not considering the cloud-edge heterogeneity, and focusing on the scheduling of single tasks instead of the optimization of the total tasks. To improve the performance of the cloud-edge collaboration, this paper establishes a practical model for task scheduling considering respectively cloud-edge environment collaboration models. We propose a novel two-stage scheduling method for IIoT. The algorithm utilizes the idea of maximum flow to divide the task into cloud-edge deployment schemes and find the best partitioning scheme, and then deploy the operator for the edge domain based on the network topology by using dynamic programming. Experimental results show that the proposed method could reduce 7.27% the cloud-edge bandwidth usage compared with the highest greedy algorithm for traffic difference, 24.33% end-to-end latency and 11.18% back-pressure rate compared with SBON.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信