An Evolutionary Algorithm for Solving Task Scheduling Problem in Cloud-Fog Computing Environment

Huynh Thi Thanh Binh, Tran The Anh, D. Son, P. Duc, B. Nguyen
{"title":"An Evolutionary Algorithm for Solving Task Scheduling Problem in Cloud-Fog Computing Environment","authors":"Huynh Thi Thanh Binh, Tran The Anh, D. Son, P. Duc, B. Nguyen","doi":"10.1145/3287921.3287984","DOIUrl":null,"url":null,"abstract":"Recently, IoT (Internet of Things) has grown steadily, which generates a tremendous amount of data and puts pressure on the cloud computing infrastructures. Fog computing architecture is proposed to be the next generation of the cloud computing to meet the requirements of the IoT network. One of the big challenges of fog computing is resource management and operating function, as task scheduling, which guarantees a high-performance and cost-effective service. We propose TCaS - an evolutionary algorithm to deal with Bag-of-Tasks application in cloud-fog computing environment. By addressing the tasks in this distributed system, our proposed approach aimed at achieving the optimal tradeoff between the execution time and operating costs. We verify our proposal by extensive simulation with various size of data set, and the experimental results demonstrate that our scheduling algorithm outperforms 38.6% Bee Life Algorithm (BLA) in time-cost tradeoff, especially, performs much better than BLA in execution time, simultaneously, satisfies user's requirement.","PeriodicalId":448008,"journal":{"name":"Proceedings of the 9th International Symposium on Information and Communication Technology","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"50","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 9th International Symposium on Information and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3287921.3287984","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 50

Abstract

Recently, IoT (Internet of Things) has grown steadily, which generates a tremendous amount of data and puts pressure on the cloud computing infrastructures. Fog computing architecture is proposed to be the next generation of the cloud computing to meet the requirements of the IoT network. One of the big challenges of fog computing is resource management and operating function, as task scheduling, which guarantees a high-performance and cost-effective service. We propose TCaS - an evolutionary algorithm to deal with Bag-of-Tasks application in cloud-fog computing environment. By addressing the tasks in this distributed system, our proposed approach aimed at achieving the optimal tradeoff between the execution time and operating costs. We verify our proposal by extensive simulation with various size of data set, and the experimental results demonstrate that our scheduling algorithm outperforms 38.6% Bee Life Algorithm (BLA) in time-cost tradeoff, especially, performs much better than BLA in execution time, simultaneously, satisfies user's requirement.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种求解云雾计算环境下任务调度问题的进化算法
近年来,物联网(IoT)稳步发展,产生了大量的数据,给云计算基础设施带来了压力。雾计算架构是为满足物联网网络的需求而提出的下一代云计算架构。雾计算面临的最大挑战之一是资源管理和操作功能,如任务调度,这保证了高性能和经济高效的服务。我们提出了一种进化算法TCaS来处理任务袋算法在云雾计算环境中的应用。通过处理这个分布式系统中的任务,我们提出的方法旨在实现执行时间和操作成本之间的最佳权衡。实验结果表明,本文提出的调度算法在时间成本权衡上优于38.6%的蜜蜂寿命算法(Bee Life algorithm, BLA),特别是在执行时间上优于BLA,同时满足了用户的需求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fully Residual Convolutional Neural Networks for Aerial Image Segmentation Techniques for Improving Performance of the CPR-Based Approach Mobile multi-scale vehicle detector and its application in traffic surveillance Intelligent Assistants in Higher-Education Environments: The FIT-EBot, a Chatbot for Administrative and Learning Support Discord Discovery in Streaming Time Series based on an Improved HOT SAX Algorithm
×
引用
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