Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Fangfang Wu , Run Zhang , Xiandong Zhang
{"title":"Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs","authors":"Fangfang Wu ,&nbsp;Run Zhang ,&nbsp;Xiandong Zhang","doi":"10.1016/j.cor.2025.107041","DOIUrl":null,"url":null,"abstract":"<div><div>This paper examines task scheduling in homogeneous multi-cluster platforms, equipped with Graphics Processing Units (GPUs), with the aim of minimizing the makespan. We assume that tasks can be parallelized across these platforms under the moldable model. Recognizing the NP-hard nature of the problem, our goal is to develop algorithms that provide approximation ratios. While existing research has established algorithms for single-cluster GPU environments, scaling these to multi-cluster platforms introduces new challenges, especially due to the restriction that tasks cannot use processors from different clusters. We propose an integer programming-based algorithm that achieves an approximation ratio of <span><math><mrow><mfrac><mrow><mn>3</mn></mrow><mrow><mn>2</mn></mrow></mfrac><mo>+</mo><mi>ϵ</mi></mrow></math></span>, trading off runtime for an improved approximation ratio. Additionally, leveraging recent theoretical advancements, we have created a polynomial-time algorithm with an approximation ratio of <span><math><mrow><mn>2</mn><mo>+</mo><mi>ϵ</mi></mrow></math></span>. Empirical computational experiments show that our algorithms surpass their counterparts in empirical approximation ratios.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107041"},"PeriodicalIF":4.1000,"publicationDate":"2025-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825000693","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper examines task scheduling in homogeneous multi-cluster platforms, equipped with Graphics Processing Units (GPUs), with the aim of minimizing the makespan. We assume that tasks can be parallelized across these platforms under the moldable model. Recognizing the NP-hard nature of the problem, our goal is to develop algorithms that provide approximation ratios. While existing research has established algorithms for single-cluster GPU environments, scaling these to multi-cluster platforms introduces new challenges, especially due to the restriction that tasks cannot use processors from different clusters. We propose an integer programming-based algorithm that achieves an approximation ratio of 32+ϵ, trading off runtime for an improved approximation ratio. Additionally, leveraging recent theoretical advancements, we have created a polynomial-time algorithm with an approximation ratio of 2+ϵ. Empirical computational experiments show that our algorithms surpass their counterparts in empirical approximation ratios.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
×
引用
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学术官方微信