基于异构多核处理器的任务调度算法研究与优化

Junnan Liu, Yifan Liu, Yongkang Ding
{"title":"基于异构多核处理器的任务调度算法研究与优化","authors":"Junnan Liu, Yifan Liu, Yongkang Ding","doi":"10.1007/s10586-024-04606-0","DOIUrl":null,"url":null,"abstract":"<p>Heterogeneous multi-core processor has the ability to switch between different types of cores to perform tasks, which provides more space and possibility for realizing efficient operation of computer system and improving computer computing power. Current research focuses on heterogeneous multiprocessor systems with high performance or low power consumption to reduce system energy consumption. However, some studies have shown that excessive voltage reduction may lead to an increase in transient failure rates, reducing system reliability. This paper studies the energy optimal scheduling problem of HMSS with DVFS under the constraints of minimum time and reliability, and proposes an improved wild horse optimization algorithm (OIWHO), which improves the efficiency of heterogeneous task scheduling and shortens the task completion time. The algorithm uses the learning and chaos perturbation strategies based on opposition and crossover strategies to balance the search and utilization capabilities, and can further improve the performance of OIWHO. Compared with previous work, our proposed algorithm has more advantages than existing algorithms. Experimental results show that the average computing time of OIWHO algorithm is 12.58%, 11.42%, 7.53%, 4.20% and 3.21% faster than DRNN-BWO, PSO, GWO-GA, GACSH and OIWOAH, respectively. Especially when solving large-scale problems, our algorithm takes less time than other algorithms.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research and optimization of task scheduling algorithm based on heterogeneous multi-core processor\",\"authors\":\"Junnan Liu, Yifan Liu, Yongkang Ding\",\"doi\":\"10.1007/s10586-024-04606-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Heterogeneous multi-core processor has the ability to switch between different types of cores to perform tasks, which provides more space and possibility for realizing efficient operation of computer system and improving computer computing power. Current research focuses on heterogeneous multiprocessor systems with high performance or low power consumption to reduce system energy consumption. However, some studies have shown that excessive voltage reduction may lead to an increase in transient failure rates, reducing system reliability. This paper studies the energy optimal scheduling problem of HMSS with DVFS under the constraints of minimum time and reliability, and proposes an improved wild horse optimization algorithm (OIWHO), which improves the efficiency of heterogeneous task scheduling and shortens the task completion time. The algorithm uses the learning and chaos perturbation strategies based on opposition and crossover strategies to balance the search and utilization capabilities, and can further improve the performance of OIWHO. Compared with previous work, our proposed algorithm has more advantages than existing algorithms. Experimental results show that the average computing time of OIWHO algorithm is 12.58%, 11.42%, 7.53%, 4.20% and 3.21% faster than DRNN-BWO, PSO, GWO-GA, GACSH and OIWOAH, respectively. Especially when solving large-scale problems, our algorithm takes less time than other algorithms.</p>\",\"PeriodicalId\":501576,\"journal\":{\"name\":\"Cluster Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cluster Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s10586-024-04606-0\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s10586-024-04606-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

异构多核处理器具有在不同类型的内核之间切换执行任务的能力,这为实现计算机系统的高效运行、提高计算机计算能力提供了更大的空间和可能。目前的研究主要集中在高性能或低功耗的异构多核处理器系统上,以降低系统能耗。然而,一些研究表明,过度降低电压可能会导致瞬态故障率增加,降低系统可靠性。本文研究了带 DVFS 的 HMSS 在最小时间和可靠性约束下的能量最优调度问题,提出了一种改进的野马优化算法(OIWHO),提高了异构任务调度的效率,缩短了任务完成时间。该算法采用基于对立和交叉策略的学习和混沌扰动策略,平衡了搜索能力和利用能力,能进一步提高 OIWHO 的性能。与之前的工作相比,我们提出的算法比现有算法更具优势。实验结果表明,OIWHO 算法的平均计算时间分别比 DRNN-BWO、PSO、GWO-GA、GACSH 和 OIWOAH 快 12.58%、11.42%、7.53%、4.20% 和 3.21%。特别是在解决大规模问题时,我们的算法比其他算法耗时更短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Research and optimization of task scheduling algorithm based on heterogeneous multi-core processor

Heterogeneous multi-core processor has the ability to switch between different types of cores to perform tasks, which provides more space and possibility for realizing efficient operation of computer system and improving computer computing power. Current research focuses on heterogeneous multiprocessor systems with high performance or low power consumption to reduce system energy consumption. However, some studies have shown that excessive voltage reduction may lead to an increase in transient failure rates, reducing system reliability. This paper studies the energy optimal scheduling problem of HMSS with DVFS under the constraints of minimum time and reliability, and proposes an improved wild horse optimization algorithm (OIWHO), which improves the efficiency of heterogeneous task scheduling and shortens the task completion time. The algorithm uses the learning and chaos perturbation strategies based on opposition and crossover strategies to balance the search and utilization capabilities, and can further improve the performance of OIWHO. Compared with previous work, our proposed algorithm has more advantages than existing algorithms. Experimental results show that the average computing time of OIWHO algorithm is 12.58%, 11.42%, 7.53%, 4.20% and 3.21% faster than DRNN-BWO, PSO, GWO-GA, GACSH and OIWOAH, respectively. Especially when solving large-scale problems, our algorithm takes less time than other algorithms.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Quantitative and qualitative similarity measure for data clustering analysis OntoXAI: a semantic web rule language approach for explainable artificial intelligence Multi-threshold image segmentation using a boosted whale optimization: case study of breast invasive ductal carcinomas PSO-ACO-based bi-phase lightweight intrusion detection system combined with GA optimized ensemble classifiers A scalable and power efficient MAC protocol with adaptive TDMA for M2M communication
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1