受客户端I/O端口约束的云计算中的Cloudlet调度算法

Waralak Chongdarakul
{"title":"受客户端I/O端口约束的云计算中的Cloudlet调度算法","authors":"Waralak Chongdarakul","doi":"10.1109/GWS.2018.8686712","DOIUrl":null,"url":null,"abstract":"Cloud computing has rapidly gained widespread use over decades according to the exponential increasing in data use. The cloud becomes an important platform provided self-service, on demand, elastic and scalable resources and services to the clients over a network with unlimited computing capacities. To deal with huge number of users and task processing requests, scheduling in cloud is crucial for the task execution. Current scheduling methods are mostly implemented to improve total completion time and cloud resource utilization. However they do not consider the task or cloudlet scheduling when the collision of sending and receiving tasks possibly occur at the client I/O port. Since the client is physically limited by the its chip set architecture, the situation that all tasks are assigned to the cloud resources simultaneously is insufficient for measuring the scheduling performance. This paper concerns the constraint of client I/O port therefore it proposes cloudlet scheduling method to achieve shortest makespan and less waiting time under the cloud environment. The proposed algorithm and other comparative algorithms are implemented in the CloudSim which is the framework simulating the cloud-based models and services. The performance evaluation shows that the proposed method outperforms other algorithms in terms of minimum makespan and less delay.","PeriodicalId":256742,"journal":{"name":"2018 Global Wireless Summit (GWS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cloudlet Scheduling Algorithm in Cloud Computing Constrained by Client I/O Port\",\"authors\":\"Waralak Chongdarakul\",\"doi\":\"10.1109/GWS.2018.8686712\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud computing has rapidly gained widespread use over decades according to the exponential increasing in data use. The cloud becomes an important platform provided self-service, on demand, elastic and scalable resources and services to the clients over a network with unlimited computing capacities. To deal with huge number of users and task processing requests, scheduling in cloud is crucial for the task execution. Current scheduling methods are mostly implemented to improve total completion time and cloud resource utilization. However they do not consider the task or cloudlet scheduling when the collision of sending and receiving tasks possibly occur at the client I/O port. Since the client is physically limited by the its chip set architecture, the situation that all tasks are assigned to the cloud resources simultaneously is insufficient for measuring the scheduling performance. This paper concerns the constraint of client I/O port therefore it proposes cloudlet scheduling method to achieve shortest makespan and less waiting time under the cloud environment. The proposed algorithm and other comparative algorithms are implemented in the CloudSim which is the framework simulating the cloud-based models and services. The performance evaluation shows that the proposed method outperforms other algorithms in terms of minimum makespan and less delay.\",\"PeriodicalId\":256742,\"journal\":{\"name\":\"2018 Global Wireless Summit (GWS)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Global Wireless Summit (GWS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GWS.2018.8686712\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Global Wireless Summit (GWS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GWS.2018.8686712","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

几十年来,随着数据使用量的指数级增长,云计算迅速得到了广泛的应用。云成为一个重要的平台,通过具有无限计算能力的网络向客户提供自助服务、随需应变、弹性和可扩展的资源和服务。为了处理大量的用户和任务处理请求,云调度对任务的执行至关重要。目前的调度方法主要是为了提高总完成时间和云资源利用率。但是,当在客户端I/O端口可能发生发送和接收任务的冲突时,它们没有考虑任务或cloudlet调度。由于客户端受到其芯片组架构的物理限制,所有任务同时分配给云资源的情况不足以衡量调度性能。考虑到客户端I/O端口的约束,本文提出了云调度方法,以实现云环境下最短的完工时间和更少的等待时间。本文提出的算法和其他比较算法在CloudSim中实现,CloudSim是模拟基于云的模型和服务的框架。性能评估表明,该方法在最大完工时间和最小延迟方面优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cloudlet Scheduling Algorithm in Cloud Computing Constrained by Client I/O Port
Cloud computing has rapidly gained widespread use over decades according to the exponential increasing in data use. The cloud becomes an important platform provided self-service, on demand, elastic and scalable resources and services to the clients over a network with unlimited computing capacities. To deal with huge number of users and task processing requests, scheduling in cloud is crucial for the task execution. Current scheduling methods are mostly implemented to improve total completion time and cloud resource utilization. However they do not consider the task or cloudlet scheduling when the collision of sending and receiving tasks possibly occur at the client I/O port. Since the client is physically limited by the its chip set architecture, the situation that all tasks are assigned to the cloud resources simultaneously is insufficient for measuring the scheduling performance. This paper concerns the constraint of client I/O port therefore it proposes cloudlet scheduling method to achieve shortest makespan and less waiting time under the cloud environment. The proposed algorithm and other comparative algorithms are implemented in the CloudSim which is the framework simulating the cloud-based models and services. The performance evaluation shows that the proposed method outperforms other algorithms in terms of minimum makespan and less delay.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信