Optimizing cloud service provider scheduling by using rough set model

Mehul Mahrishi, Aitha Nagaraju
{"title":"Optimizing cloud service provider scheduling by using rough set model","authors":"Mehul Mahrishi, Aitha Nagaraju","doi":"10.1109/ICCCTAM.2012.6488103","DOIUrl":null,"url":null,"abstract":"The applications submitted to cloud middle ware have been distributed to the CSPs based on the available CSPs in the cloud environment to categorize the service CSP providers with this work we are trying to introduce a concept to find the optimal csp based on rough set based approach. IaaS provides a large amount of computational capacities to users in a flexible and efficient way. In the market various CSPs are available example Amazons elastic computing cloud offers virtual machine with 0.1 us dollars per hour similarly another cloud Google compute cloud offers virtual machine with 0.5 us dollars per hour then the cloud users need rating among the various Csps. In this research work we have been proposing an approach to provide the rating of CSPs based on the internal performance of Datacenters and virtual machines. In present situation day-by- day number of cloud service providers have been increasing drastically. In this scenario existing service providers scheduling need a mechanism to find the optimal service providers information to Service request scheduling using this information SRS can allocate the service to the respective optimal service providers. In this paper we studied the problem of dynamic request allocation and scheduling for context aware application deployed in geographically distributed data centers forming a cloud.","PeriodicalId":111485,"journal":{"name":"2012 International Conference on Cloud Computing Technologies, Applications and Management (ICCCTAM)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Cloud Computing Technologies, Applications and Management (ICCCTAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCTAM.2012.6488103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

The applications submitted to cloud middle ware have been distributed to the CSPs based on the available CSPs in the cloud environment to categorize the service CSP providers with this work we are trying to introduce a concept to find the optimal csp based on rough set based approach. IaaS provides a large amount of computational capacities to users in a flexible and efficient way. In the market various CSPs are available example Amazons elastic computing cloud offers virtual machine with 0.1 us dollars per hour similarly another cloud Google compute cloud offers virtual machine with 0.5 us dollars per hour then the cloud users need rating among the various Csps. In this research work we have been proposing an approach to provide the rating of CSPs based on the internal performance of Datacenters and virtual machines. In present situation day-by- day number of cloud service providers have been increasing drastically. In this scenario existing service providers scheduling need a mechanism to find the optimal service providers information to Service request scheduling using this information SRS can allocate the service to the respective optimal service providers. In this paper we studied the problem of dynamic request allocation and scheduling for context aware application deployed in geographically distributed data centers forming a cloud.
利用粗糙集模型优化云服务提供商调度
提交给云中间件的应用程序已经根据云环境中可用的云服务提供商(CSP)分发给云服务提供商(CSP),以便对云服务提供商(CSP)进行分类。在这项工作中,我们试图引入一种基于粗糙集的方法来寻找最优的云服务提供商(CSP)。IaaS以灵活高效的方式为用户提供大量的计算能力。在市场上有各种各样的云计算服务提供商,例如亚马逊的弹性计算云提供虚拟机,每小时0.1美元,类似的另一个云,谷歌计算云提供虚拟机,每小时0.5美元,然后云用户需要在各种云计算服务提供商之间进行评级。在这项研究工作中,我们提出了一种基于数据中心和虚拟机的内部性能来提供csp评级的方法。在目前的情况下,云服务提供商的数量每天都在急剧增加。在这种情况下,现有的服务提供者调度需要一种机制来找到最优的服务提供者信息来进行服务请求调度,使用这些信息SRS可以将服务分配给各自的最优服务提供者。本文研究了部署在地理分布的云数据中心中的上下文感知应用程序的动态请求分配和调度问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信