QoS and Profit Aware Task Scheduling with Simulated-Annealing-Based Bi-Objective Differential Evolution in Green Clouds

Haitao Yuan, J. Bi, Mengchu Zhou
{"title":"QoS and Profit Aware Task Scheduling with Simulated-Annealing-Based Bi-Objective Differential Evolution in Green Clouds","authors":"Haitao Yuan, J. Bi, Mengchu Zhou","doi":"10.1109/COASE.2019.8842927","DOIUrl":null,"url":null,"abstract":"Distributed clouds (DCs) often require a huge amount of energy to provide multiple services to users around the world. Users bring revenue to DC providers based on the quality of service (QoS) of tasks. These tasks are transmitted to DCs through many available Internet service providers (ISPs) with different bandwidth prices and capacities. Besides, power grid prices, and green energy in different DCs differ with different geographical sites. Consequently, it is challenging to execute tasks among DCs in a high-QoS and high-profit way. This work proposes a bi-objective optimization algorithm to maximize the profit of a DC provider, and minimize the loss possibility of all tasks by specifying the allocation of tasks among different ISPs, and task service rates of each DC. A constrained optimization problem is given and solved by a novel Simulated-annealing-based Bi-objective Differential Evolution (SBDE) algorithm to produce a close-to-optimal Pareto set of solutions. The minimum Manhattan distance is further used to obtain a knee solution, and it determines Pareto optimal service rates and task allocation among ISPs. Realistic trace-driven results demonstrate that SBDE realizes less loss possibility of tasks, and higher profit than several state-of-the-art scheduling algorithms.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"21 1","pages":"904-909"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2019.8842927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Distributed clouds (DCs) often require a huge amount of energy to provide multiple services to users around the world. Users bring revenue to DC providers based on the quality of service (QoS) of tasks. These tasks are transmitted to DCs through many available Internet service providers (ISPs) with different bandwidth prices and capacities. Besides, power grid prices, and green energy in different DCs differ with different geographical sites. Consequently, it is challenging to execute tasks among DCs in a high-QoS and high-profit way. This work proposes a bi-objective optimization algorithm to maximize the profit of a DC provider, and minimize the loss possibility of all tasks by specifying the allocation of tasks among different ISPs, and task service rates of each DC. A constrained optimization problem is given and solved by a novel Simulated-annealing-based Bi-objective Differential Evolution (SBDE) algorithm to produce a close-to-optimal Pareto set of solutions. The minimum Manhattan distance is further used to obtain a knee solution, and it determines Pareto optimal service rates and task allocation among ISPs. Realistic trace-driven results demonstrate that SBDE realizes less loss possibility of tasks, and higher profit than several state-of-the-art scheduling algorithms.
绿色云环境下基于模拟退火的双目标差分进化的QoS和利润感知任务调度
分布式云(DCs)通常需要大量的能源来为世界各地的用户提供多种服务。用户根据任务的服务质量(QoS)为数据中心提供商带来收益。这些任务通过许多具有不同带宽价格和容量的可用互联网服务提供商(isp)传输到数据中心。此外,不同数据中心的电网价格和绿色能源也因地理位置的不同而不同。因此,在数据中心之间以高qos和高利润的方式执行任务是一个挑战。本文提出了一种双目标优化算法,通过指定任务在不同isp之间的分配和每个DC的任务服务率,使数据中心提供商的利润最大化,并使所有任务的损失可能性最小化。提出了一种基于模拟退火的双目标差分进化(SBDE)算法求解约束优化问题,得到了一个接近最优的Pareto解集。利用最小曼哈顿距离得到膝解,确定了网络服务提供商之间的帕累托最优服务费率和任务分配。实际跟踪驱动的结果表明,与几种最先进的调度算法相比,SBDE实现了更小的任务损失可能性和更高的利润。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信