一种提高云服务质量的在线调度新方法

Aida A. Nasr, Nirmeen A. El-Bahnasawy, Gamal Attiya, Ayman El-Sayed
{"title":"一种提高云服务质量的在线调度新方法","authors":"Aida A. Nasr,&nbsp;Nirmeen A. El-Bahnasawy,&nbsp;Gamal Attiya,&nbsp;Ayman El-Sayed","doi":"10.1016/j.fcij.2018.11.005","DOIUrl":null,"url":null,"abstract":"<div><p>Quality-of-Services (<em>QoS</em>) is one of the most important requirements of cloud users. So, cloud providers continuously try to enhance cloud management tools to guarantee the required QoS and provide users the services with high quality. One of the most important management tools which play a vital role in enhancing <em>QoS</em> is scheduling. Scheduling is the process of assigning users’ tasks into available Virtual Machines (VMs). This paper presents a new task scheduling approach, called Online Potential Finish Time (<em>OPFT</em>), to enhance the cloud data-center broker, which is responsible for the scheduling process, and solve the QoS issue. The main idea of the new approach is inspired from the idea of passing vehicles through the highways. Whenever the width of the road increases, the number of passing vehicles increases. We apply this idea to assign different users’ tasks into the available VMs. The number of tasks that are allocated to a VM is in proportion to the processing power of this VM. Whenever the VM capacity increases, the number of tasks that are assigned into this VM increases. The proposed <em>OPFT</em> approach is evaluated using the <em>CloudSim</em> simulator considering real tasks and real cost model. The experimental results indicate that the proposed <em>OPFT</em> algorithm is more efficient than the <em>FCFS</em>, <em>RR</em>, <em>Min-Min</em>, and <em>MCT</em> algorithms in terms of schedule length, cost, balance degree, response time and resource utilization.</p></div>","PeriodicalId":100561,"journal":{"name":"Future Computing and Informatics Journal","volume":"3 2","pages":"Pages 424-435"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.fcij.2018.11.005","citationCount":"11","resultStr":"{\"title\":\"A new online scheduling approach for enhancing QOS in cloud\",\"authors\":\"Aida A. Nasr,&nbsp;Nirmeen A. El-Bahnasawy,&nbsp;Gamal Attiya,&nbsp;Ayman El-Sayed\",\"doi\":\"10.1016/j.fcij.2018.11.005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Quality-of-Services (<em>QoS</em>) is one of the most important requirements of cloud users. So, cloud providers continuously try to enhance cloud management tools to guarantee the required QoS and provide users the services with high quality. One of the most important management tools which play a vital role in enhancing <em>QoS</em> is scheduling. Scheduling is the process of assigning users’ tasks into available Virtual Machines (VMs). This paper presents a new task scheduling approach, called Online Potential Finish Time (<em>OPFT</em>), to enhance the cloud data-center broker, which is responsible for the scheduling process, and solve the QoS issue. The main idea of the new approach is inspired from the idea of passing vehicles through the highways. Whenever the width of the road increases, the number of passing vehicles increases. We apply this idea to assign different users’ tasks into the available VMs. The number of tasks that are allocated to a VM is in proportion to the processing power of this VM. Whenever the VM capacity increases, the number of tasks that are assigned into this VM increases. The proposed <em>OPFT</em> approach is evaluated using the <em>CloudSim</em> simulator considering real tasks and real cost model. The experimental results indicate that the proposed <em>OPFT</em> algorithm is more efficient than the <em>FCFS</em>, <em>RR</em>, <em>Min-Min</em>, and <em>MCT</em> algorithms in terms of schedule length, cost, balance degree, response time and resource utilization.</p></div>\",\"PeriodicalId\":100561,\"journal\":{\"name\":\"Future Computing and Informatics Journal\",\"volume\":\"3 2\",\"pages\":\"Pages 424-435\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.fcij.2018.11.005\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Future Computing and Informatics Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2314728818300138\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Computing and Informatics Journal","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2314728818300138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

服务质量(QoS)是云用户最重要的需求之一。因此,云提供商不断尝试增强云管理工具,以保证所需的QoS,为用户提供高质量的服务。调度是提高服务质量最重要的管理工具之一。调度是将用户的任务分配到可用的虚拟机的过程。本文提出了一种新的任务调度方法,称为在线潜在完成时间(OPFT),以增强负责调度过程的云数据中心代理,并解决QoS问题。新方法的主要思想灵感来自于通过高速公路的车辆的想法。每当道路宽度增加时,过往车辆的数量就会增加。我们应用这个想法将不同用户的任务分配到可用的vm中。分配给虚拟机的任务数量与虚拟机的处理能力成正比。随着虚拟机容量的增加,分配给该虚拟机的任务数量也会随之增加。使用CloudSim模拟器考虑实际任务和实际成本模型对所提出的OPFT方法进行了评估。实验结果表明,该算法在调度长度、成本、平衡度、响应时间和资源利用率等方面均优于FCFS、RR、Min-Min和MCT算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new online scheduling approach for enhancing QOS in cloud

Quality-of-Services (QoS) is one of the most important requirements of cloud users. So, cloud providers continuously try to enhance cloud management tools to guarantee the required QoS and provide users the services with high quality. One of the most important management tools which play a vital role in enhancing QoS is scheduling. Scheduling is the process of assigning users’ tasks into available Virtual Machines (VMs). This paper presents a new task scheduling approach, called Online Potential Finish Time (OPFT), to enhance the cloud data-center broker, which is responsible for the scheduling process, and solve the QoS issue. The main idea of the new approach is inspired from the idea of passing vehicles through the highways. Whenever the width of the road increases, the number of passing vehicles increases. We apply this idea to assign different users’ tasks into the available VMs. The number of tasks that are allocated to a VM is in proportion to the processing power of this VM. Whenever the VM capacity increases, the number of tasks that are assigned into this VM increases. The proposed OPFT approach is evaluated using the CloudSim simulator considering real tasks and real cost model. The experimental results indicate that the proposed OPFT algorithm is more efficient than the FCFS, RR, Min-Min, and MCT algorithms in terms of schedule length, cost, balance degree, response time and resource utilization.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信