Parallelized solver based on branch and bound method for task scheduling problems in consideration of communication overhead

Shibuya Tomonori, M. Kai
{"title":"Parallelized solver based on branch and bound method for task scheduling problems in consideration of communication overhead","authors":"Shibuya Tomonori, M. Kai","doi":"10.1109/PACRIM.2015.7334875","DOIUrl":null,"url":null,"abstract":"In order to process the task-graphed parallel solution objects in a shortest time, task scheduling is important. Task scheduling is, however, a strong NP-hard combinatorial optimization problem, and therefore it is difficult to obtain optimal solution in a practical period of time with the task scheduling. For problems additionally extended to take inter-processor communication delay into consideration, it will be more time-consuming to obtain the optimal solution. For these problems, the authors perform parallelized optimal solution search based on branch and bound method. For the sake of effective and high-speed optimal solution search, it is necessary that the lowest limit of the process time from each task for bounding operation to the end of the final task be found out with consideration of the communication time between the tasks. In this study, we developed a method for improving the accuracy of the lower bound and a GUI tool for allowing to manually interfere the search order for the parallel search in order to find out better heuristics useful for the searching.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2015.7334875","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In order to process the task-graphed parallel solution objects in a shortest time, task scheduling is important. Task scheduling is, however, a strong NP-hard combinatorial optimization problem, and therefore it is difficult to obtain optimal solution in a practical period of time with the task scheduling. For problems additionally extended to take inter-processor communication delay into consideration, it will be more time-consuming to obtain the optimal solution. For these problems, the authors perform parallelized optimal solution search based on branch and bound method. For the sake of effective and high-speed optimal solution search, it is necessary that the lowest limit of the process time from each task for bounding operation to the end of the final task be found out with consideration of the communication time between the tasks. In this study, we developed a method for improving the accuracy of the lower bound and a GUI tool for allowing to manually interfere the search order for the parallel search in order to find out better heuristics useful for the searching.
考虑通信开销的任务调度问题的分支定界并行求解器
为了在最短的时间内处理任务图并行解对象,任务调度至关重要。然而,任务调度是一个强NP-hard组合优化问题,因此任务调度很难在实际时间内获得最优解。对于额外扩展到考虑处理器间通信延迟的问题,获得最优解将花费更多的时间。针对这些问题,作者采用了基于分支定界法的并行最优解搜索。为了高效、高速地搜索最优解,需要在考虑任务间通信时间的情况下,找出从每个任务进行边界操作到最终任务结束的处理时间的最小极限。在这项研究中,我们开发了一种提高下界精度的方法和一个GUI工具,允许手动干扰并行搜索的搜索顺序,以便找到对搜索有用的更好的启发式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信