Time-Aware Task Allocation for Cloud Computing Environment

Sushanta Meher, S. K. Pande, S. K. Panda
{"title":"Time-Aware Task Allocation for Cloud Computing Environment","authors":"Sushanta Meher, S. K. Pande, S. K. Panda","doi":"10.4018/IJKDB.2017010101","DOIUrl":null,"url":null,"abstract":"Cloud computing provides access to various services such as servers, storage and applications to the customers' as and when required. The services on the cloud can be accessed with minimum efforts through any handheld devices that are connected to the Internet. In IaaS cloud, the services to the customers are provided in the form of two leases, AR and BE. Here, a running BE lease can be preempted upon arrival of an AR lease as BE has lower priority. However, frequent preemption of the BE lease causes an overhead to the system and leads to customer dissatisfaction. In this paper, we propose a fairness algorithm called TATA to provide fairness among the leases. We evaluate the proposed algorithm on various synthetic datasets and compare the results with an existing fairness algorithm. The results of simulation show that TATA produces better response time for both the leases than the existing algorithm.","PeriodicalId":160270,"journal":{"name":"Int. J. Knowl. Discov. Bioinform.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Knowl. Discov. Bioinform.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJKDB.2017010101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Cloud computing provides access to various services such as servers, storage and applications to the customers' as and when required. The services on the cloud can be accessed with minimum efforts through any handheld devices that are connected to the Internet. In IaaS cloud, the services to the customers are provided in the form of two leases, AR and BE. Here, a running BE lease can be preempted upon arrival of an AR lease as BE has lower priority. However, frequent preemption of the BE lease causes an overhead to the system and leads to customer dissatisfaction. In this paper, we propose a fairness algorithm called TATA to provide fairness among the leases. We evaluate the proposed algorithm on various synthetic datasets and compare the results with an existing fairness algorithm. The results of simulation show that TATA produces better response time for both the leases than the existing algorithm.
云计算环境下的时间感知任务分配
云计算在需要的时候为客户提供对服务器、存储和应用程序等各种服务的访问。可以通过连接到互联网的任何手持设备轻松访问云上的服务。在IaaS云中,向客户提供的服务以两种租赁的形式提供,AR和BE。在这里,运行的BE租赁可以在AR租赁到达时被抢占,因为BE具有较低的优先级。然而,频繁抢占BE租约会给系统带来开销,并导致客户不满。在本文中,我们提出了一种称为TATA的公平性算法来提供租赁之间的公平性。我们在各种合成数据集上评估了所提出的算法,并将结果与现有的公平性算法进行了比较。仿真结果表明,与现有算法相比,TATA算法在两种租约下都能产生更好的响应时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信