异构多云环境下的多目标任务调度算法

S. K. Panda, P. K. Jana
{"title":"异构多云环境下的多目标任务调度算法","authors":"S. K. Panda, P. K. Jana","doi":"10.1109/EDCAV.2015.7060544","DOIUrl":null,"url":null,"abstract":"Cloud Computing has become a popular computing paradigm which has gained enormous attention in delivering on-demand services. Task scheduling in cloud computing is an important issue that has been well researched and many algorithms have been developed for the same. However, the goal of most of these algorithms is to minimize the overall completion time (i.e., makespan) without looking into minimization of the overall cost of the service (referred as budget). Moreover, many of them are applicable to single-cloud environment. In this paper, we propose a multi-objective task scheduling algorithm for heterogeneous multi-cloud environment which takes care both these issues. We perform rigorous experiments on some synthetic and benchmark data sets. The experimental results show that the proposed algorithm balances both the makespan and total cost in contrast to two existing task scheduling algorithms in terms of various performance metrics including makespan, total cost and average cloud utilization.","PeriodicalId":277103,"journal":{"name":"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"71","resultStr":"{\"title\":\"A multi-objective task scheduling algorithm for heterogeneous multi-cloud environment\",\"authors\":\"S. K. Panda, P. K. Jana\",\"doi\":\"10.1109/EDCAV.2015.7060544\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud Computing has become a popular computing paradigm which has gained enormous attention in delivering on-demand services. Task scheduling in cloud computing is an important issue that has been well researched and many algorithms have been developed for the same. However, the goal of most of these algorithms is to minimize the overall completion time (i.e., makespan) without looking into minimization of the overall cost of the service (referred as budget). Moreover, many of them are applicable to single-cloud environment. In this paper, we propose a multi-objective task scheduling algorithm for heterogeneous multi-cloud environment which takes care both these issues. We perform rigorous experiments on some synthetic and benchmark data sets. The experimental results show that the proposed algorithm balances both the makespan and total cost in contrast to two existing task scheduling algorithms in terms of various performance metrics including makespan, total cost and average cloud utilization.\",\"PeriodicalId\":277103,\"journal\":{\"name\":\"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"71\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDCAV.2015.7060544\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDCAV.2015.7060544","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 71

摘要

云计算已经成为一种流行的计算范式,它在提供按需服务方面获得了极大的关注。任务调度是云计算中的一个重要问题,已经得到了很好的研究,并开发了许多算法。然而,大多数这些算法的目标是最小化总体完成时间(即makespan),而不考虑最小化服务的总体成本(称为预算)。而且,其中很多都适用于单云环境。本文提出了一种异构多云环境下兼顾这两个问题的多目标任务调度算法。我们在一些合成和基准数据集上进行了严格的实验。实验结果表明,与现有的两种任务调度算法相比,该算法在最大时间跨度、总成本和平均云利用率等性能指标上平衡了最大时间跨度和总成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A multi-objective task scheduling algorithm for heterogeneous multi-cloud environment
Cloud Computing has become a popular computing paradigm which has gained enormous attention in delivering on-demand services. Task scheduling in cloud computing is an important issue that has been well researched and many algorithms have been developed for the same. However, the goal of most of these algorithms is to minimize the overall completion time (i.e., makespan) without looking into minimization of the overall cost of the service (referred as budget). Moreover, many of them are applicable to single-cloud environment. In this paper, we propose a multi-objective task scheduling algorithm for heterogeneous multi-cloud environment which takes care both these issues. We perform rigorous experiments on some synthetic and benchmark data sets. The experimental results show that the proposed algorithm balances both the makespan and total cost in contrast to two existing task scheduling algorithms in terms of various performance metrics including makespan, total cost and average cloud utilization.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Numerical modelling for a basic switching unit based on nonlinear plasmonic two mode waveguide Color image noise removal by modified adaptive threshold median filter for RVIN A review on accelerating scientific computations using the Conjugate Gradient method A novel approach for constrained via minimization problem in VLSI channel routing A method for determination of depletion width of single and double gate junction less transistor
×
引用
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