云计算中节能作业调度的主动框架

Rupinder Singh, M. Agnihotri
{"title":"云计算中节能作业调度的主动框架","authors":"Rupinder Singh, M. Agnihotri","doi":"10.1109/IC3I.2016.7918054","DOIUrl":null,"url":null,"abstract":"Cloud Computing is a very fast emerging technology as every enterprise is moving fast towards this system. Cloud Computing is known as a provider of dynamic services. It optimizes a very large, scalable and virtualized resource. So lots of industries have joined this bandwagon nowadays. One of the major research issues is to maintain good Quality of Service (QoS) of a Cloud Service Provider (CSP). The QoS encompasses different parameters, like, smart job allocation strategy, efficient load balancing, response time optimization, reduction in wastage of bandwidth, accountability of the overall system, etc. The efficient allocation strategy of the independent computational jobs among different Virtual Machines (VM) in a Datacenter (DC) is a distinguishable challenge in the Cloud Computing domain and finding out an optimal job allocation strategy guided by a good scheduling heuristic for such an environment is an Mape-k loop problem. So different heuristic approaches may be used for better result and in this work we implement worst fit in Mape-k and evaluated the results.","PeriodicalId":305971,"journal":{"name":"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Proactive framework for energy efficient job scheduling in cloud computing\",\"authors\":\"Rupinder Singh, M. Agnihotri\",\"doi\":\"10.1109/IC3I.2016.7918054\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud Computing is a very fast emerging technology as every enterprise is moving fast towards this system. Cloud Computing is known as a provider of dynamic services. It optimizes a very large, scalable and virtualized resource. So lots of industries have joined this bandwagon nowadays. One of the major research issues is to maintain good Quality of Service (QoS) of a Cloud Service Provider (CSP). The QoS encompasses different parameters, like, smart job allocation strategy, efficient load balancing, response time optimization, reduction in wastage of bandwidth, accountability of the overall system, etc. The efficient allocation strategy of the independent computational jobs among different Virtual Machines (VM) in a Datacenter (DC) is a distinguishable challenge in the Cloud Computing domain and finding out an optimal job allocation strategy guided by a good scheduling heuristic for such an environment is an Mape-k loop problem. So different heuristic approaches may be used for better result and in this work we implement worst fit in Mape-k and evaluated the results.\",\"PeriodicalId\":305971,\"journal\":{\"name\":\"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3I.2016.7918054\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3I.2016.7918054","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

云计算是一项非常快速的新兴技术,因为每个企业都在快速向该系统移动。云计算被称为动态服务的提供者。它优化了一个非常大的、可扩展的虚拟化资源。因此,如今许多行业都加入了这一潮流。如何保持云服务提供商(CSP)的良好服务质量(QoS)是云服务提供商(CSP)的主要研究问题之一。QoS包含不同的参数,如智能作业分配策略、高效负载平衡、响应时间优化、减少带宽浪费、整个系统的问责制等。在数据中心(DC)中,独立计算任务在不同虚拟机(VM)之间的有效分配策略是云计算领域的一个重要挑战,在这种环境下,寻找一个由良好的调度启发式指导的最优任务分配策略是一个Mape-k循环问题。因此,不同的启发式方法可以用来获得更好的结果,在这项工作中,我们在Mape-k中实现了最差拟合并评估了结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Proactive framework for energy efficient job scheduling in cloud computing
Cloud Computing is a very fast emerging technology as every enterprise is moving fast towards this system. Cloud Computing is known as a provider of dynamic services. It optimizes a very large, scalable and virtualized resource. So lots of industries have joined this bandwagon nowadays. One of the major research issues is to maintain good Quality of Service (QoS) of a Cloud Service Provider (CSP). The QoS encompasses different parameters, like, smart job allocation strategy, efficient load balancing, response time optimization, reduction in wastage of bandwidth, accountability of the overall system, etc. The efficient allocation strategy of the independent computational jobs among different Virtual Machines (VM) in a Datacenter (DC) is a distinguishable challenge in the Cloud Computing domain and finding out an optimal job allocation strategy guided by a good scheduling heuristic for such an environment is an Mape-k loop problem. So different heuristic approaches may be used for better result and in this work we implement worst fit in Mape-k and evaluated the results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信