Service Flow Management with deadline and budget Constraints using Genetic Algorithm in Heterogeneous Computing

A. Abdelhamed, Medhat A. Tawfik, A. Keshk
{"title":"Service Flow Management with deadline and budget Constraints using Genetic Algorithm in Heterogeneous Computing","authors":"A. Abdelhamed, Medhat A. Tawfik, A. Keshk","doi":"10.21608/IJCI.2019.35121","DOIUrl":null,"url":null,"abstract":"The service flow management is one from the most challenges especially in heterogeneous environments which has several and various processors for computing. Service flow is used to explain services configuration process when service’s formation according to the precedence relations of configuration should be considered. Its management should take into account multi-objective constraints. The total execution time should not be completed after the specified time that leading to consider the deadline constraint into account. Also the cost minimization that is a critical issue shouldn’t be ignored. Obtaining the optimal management in a sensible time is so hard because there are many candidate with different processing power and price, constraints from the user and the precedence of heterogeneous services. In this paper, the service flow management problem is solved by a genetic algorithm that considers deadline and cost constraints. It focuses on the improvement of execution time to meet the deadline constraint and minimizes the execution cost according to the budget in heterogeneous computing. The results from the applied experiments proves that the proposed algorithm can be able to minimize total cost, and consolidate the execution time with the deadline constraint. It reach to a near-optimal solution in reasonable time. It outperforms the compared algorithms in the metric of Schedule Length Ratio (SLR), cost, risk ratio, speed up and completion time measurements.","PeriodicalId":137729,"journal":{"name":"IJCI. International Journal of Computers and Information","volume":"254 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IJCI. International Journal of Computers and Information","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21608/IJCI.2019.35121","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The service flow management is one from the most challenges especially in heterogeneous environments which has several and various processors for computing. Service flow is used to explain services configuration process when service’s formation according to the precedence relations of configuration should be considered. Its management should take into account multi-objective constraints. The total execution time should not be completed after the specified time that leading to consider the deadline constraint into account. Also the cost minimization that is a critical issue shouldn’t be ignored. Obtaining the optimal management in a sensible time is so hard because there are many candidate with different processing power and price, constraints from the user and the precedence of heterogeneous services. In this paper, the service flow management problem is solved by a genetic algorithm that considers deadline and cost constraints. It focuses on the improvement of execution time to meet the deadline constraint and minimizes the execution cost according to the budget in heterogeneous computing. The results from the applied experiments proves that the proposed algorithm can be able to minimize total cost, and consolidate the execution time with the deadline constraint. It reach to a near-optimal solution in reasonable time. It outperforms the compared algorithms in the metric of Schedule Length Ratio (SLR), cost, risk ratio, speed up and completion time measurements.
异构计算中具有期限和预算约束的遗传算法的业务流管理
服务流管理是最大的挑战之一,特别是在异构环境中,有多个不同的处理器进行计算。当需要考虑服务按照配置的优先关系形成时,服务流用来解释服务的配置过程。其管理应考虑多目标约束。总执行时间不应在指定时间之后完成,这会导致考虑最后期限约束。此外,成本最小化也是一个不容忽视的关键问题。由于存在许多处理能力和价格不同的候选节点、用户的约束以及异构服务的优先级,在合理的时间内实现最优管理是非常困难的。本文采用一种考虑时间和成本约束的遗传算法来解决服务流管理问题。它侧重于改进执行时间以满足最后期限约束,并根据预算最小化执行成本。应用实验结果表明,该算法能够最大限度地降低总成本,并将执行时间与最后期限约束相结合。在合理的时间内达到近似最优解。它在进度长度比(SLR)、成本、风险比、加速和完工时间等指标上都优于比较算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信