异构计算系统中时限约束交错工作流的动态调度

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Kun Cai;Quanwang Wu;Mengchu Zhou;Chao Chen;Junhao Wen;Shouguang Wang
{"title":"异构计算系统中时限约束交错工作流的动态调度","authors":"Kun Cai;Quanwang Wu;Mengchu Zhou;Chao Chen;Junhao Wen;Shouguang Wang","doi":"10.1109/TSC.2025.3536317","DOIUrl":null,"url":null,"abstract":"Heterogeneous computing systems are extensively utilized to execute a wide range of time-critical services, which encompass numerous interdependent tasks organized in the form of workflows. In practice, the dynamic arrival of workflows often interleaves with their execution, leading to resource contention among multiple workflows and potentially causing QoS (Quality of Service) degradation. However, compared to the extensive research on single workflow scheduling, interleaved workflow scheduling has received relatively less attention. Moreover, the challenge of effectively scheduling limited computing resources to promptly complete consecutively arriving workflows remains underexplored, despite its practical importance. To fill this gap, this work proposes a method called Urgency-based List Scheduling (ULS) for dynamically scheduling deadline-constrained interleaved workflows. In ULS, a novel task property called urgency is introduced to prioritize tasks from multiple workflows by capturing real-time execution information, and each newly arrived workflow is scheduled with the outstanding tasks of prior workflows based on a list-based strategy to make more informed decisions. Extensive evaluation experiments are performed and the findings illustrate that ULS can achieve a reduction of at least 68% in deadline miss rates and 77% in overall tardiness compared to existing methods.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 2","pages":"758-769"},"PeriodicalIF":5.5000,"publicationDate":"2025-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamically Scheduling Deadline-Constrained Interleaved Workflows on Heterogeneous Computing Systems\",\"authors\":\"Kun Cai;Quanwang Wu;Mengchu Zhou;Chao Chen;Junhao Wen;Shouguang Wang\",\"doi\":\"10.1109/TSC.2025.3536317\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Heterogeneous computing systems are extensively utilized to execute a wide range of time-critical services, which encompass numerous interdependent tasks organized in the form of workflows. In practice, the dynamic arrival of workflows often interleaves with their execution, leading to resource contention among multiple workflows and potentially causing QoS (Quality of Service) degradation. However, compared to the extensive research on single workflow scheduling, interleaved workflow scheduling has received relatively less attention. Moreover, the challenge of effectively scheduling limited computing resources to promptly complete consecutively arriving workflows remains underexplored, despite its practical importance. To fill this gap, this work proposes a method called Urgency-based List Scheduling (ULS) for dynamically scheduling deadline-constrained interleaved workflows. In ULS, a novel task property called urgency is introduced to prioritize tasks from multiple workflows by capturing real-time execution information, and each newly arrived workflow is scheduled with the outstanding tasks of prior workflows based on a list-based strategy to make more informed decisions. Extensive evaluation experiments are performed and the findings illustrate that ULS can achieve a reduction of at least 68% in deadline miss rates and 77% in overall tardiness compared to existing methods.\",\"PeriodicalId\":13255,\"journal\":{\"name\":\"IEEE Transactions on Services Computing\",\"volume\":\"18 2\",\"pages\":\"758-769\"},\"PeriodicalIF\":5.5000,\"publicationDate\":\"2025-01-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Services Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10858437/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10858437/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

异构计算系统被广泛用于执行各种时间关键型服务,这些服务包括以工作流形式组织的许多相互依赖的任务。在实践中,工作流的动态到达经常与它们的执行交织在一起,导致多个工作流之间的资源争用,并可能导致QoS(服务质量)的降低。然而,与对单工作流调度的广泛研究相比,交错工作流调度受到的关注相对较少。此外,有效地调度有限的计算资源以迅速完成连续到达的工作流的挑战仍然没有得到充分的探索,尽管它具有实际重要性。为了填补这一空白,本工作提出了一种基于紧急列表调度(ULS)的方法,用于动态调度受截止日期约束的交错工作流。在ULS中,通过捕获实时执行信息,引入了一种新的任务属性“紧迫性”来对多个工作流中的任务进行优先级排序,并且每个新到达的工作流都基于基于列表的策略与先前工作流的未完成任务进行调度,以做出更明智的决策。进行了广泛的评估实验,结果表明,与现有方法相比,ULS可以减少至少68%的截止日期遗漏率和77%的总体延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamically Scheduling Deadline-Constrained Interleaved Workflows on Heterogeneous Computing Systems
Heterogeneous computing systems are extensively utilized to execute a wide range of time-critical services, which encompass numerous interdependent tasks organized in the form of workflows. In practice, the dynamic arrival of workflows often interleaves with their execution, leading to resource contention among multiple workflows and potentially causing QoS (Quality of Service) degradation. However, compared to the extensive research on single workflow scheduling, interleaved workflow scheduling has received relatively less attention. Moreover, the challenge of effectively scheduling limited computing resources to promptly complete consecutively arriving workflows remains underexplored, despite its practical importance. To fill this gap, this work proposes a method called Urgency-based List Scheduling (ULS) for dynamically scheduling deadline-constrained interleaved workflows. In ULS, a novel task property called urgency is introduced to prioritize tasks from multiple workflows by capturing real-time execution information, and each newly arrived workflow is scheduled with the outstanding tasks of prior workflows based on a list-based strategy to make more informed decisions. Extensive evaluation experiments are performed and the findings illustrate that ULS can achieve a reduction of at least 68% in deadline miss rates and 77% in overall tardiness compared to existing methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
×
引用
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学术官方微信