云计算系统中经济资源分配赢家确定的新方法

E. B. Nejad, Rezvan Alipoor Sabzevari
{"title":"云计算系统中经济资源分配赢家确定的新方法","authors":"E. B. Nejad, Rezvan Alipoor Sabzevari","doi":"10.20474/-jater2.1.3","DOIUrl":null,"url":null,"abstract":"Cloud computing systems are large-scale distributed systems, so that they focus more on large scale resource sharing, cooperation of several organizations and their use in new applications. One of the main challenges in this realm is resource allocation. There are many different ways of resource allocation in cloud computing. One of the common methods of resource allocation are economic methods. Among these methods, the auctionbased method has greater prominence compared with Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. This method includes two phases: winner determination and resource allocation. In this paper a new method has been presented to determine winner in double combinatorial auction-based resource allocation using Imperialist Competitive Algorithm (ICA). The experimental results show that in our new proposed method, the number of winner users is higher than genetic algorithm. On the other hand, in proposed algorithm, the number of winner providers is higher in genetic algorithm. © 2016 TAF Publishing. All rights reserved.","PeriodicalId":104722,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A New Method to Winner Determination for Economic Resource Allocation in Cloud Computing Systems\",\"authors\":\"E. B. Nejad, Rezvan Alipoor Sabzevari\",\"doi\":\"10.20474/-jater2.1.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud computing systems are large-scale distributed systems, so that they focus more on large scale resource sharing, cooperation of several organizations and their use in new applications. One of the main challenges in this realm is resource allocation. There are many different ways of resource allocation in cloud computing. One of the common methods of resource allocation are economic methods. Among these methods, the auctionbased method has greater prominence compared with Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. This method includes two phases: winner determination and resource allocation. In this paper a new method has been presented to determine winner in double combinatorial auction-based resource allocation using Imperialist Competitive Algorithm (ICA). The experimental results show that in our new proposed method, the number of winner users is higher than genetic algorithm. On the other hand, in proposed algorithm, the number of winner providers is higher in genetic algorithm. © 2016 TAF Publishing. All rights reserved.\",\"PeriodicalId\":104722,\"journal\":{\"name\":\"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20474/-jater2.1.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20474/-jater2.1.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

云计算系统是大规模的分布式系统,因此它们更关注大规模的资源共享、多个组织的合作以及它们在新应用程序中的使用。这一领域的主要挑战之一是资源分配。在云计算中有许多不同的资源分配方式。资源配置的常用方法之一是经济方法。在这些方法中,以拍卖为基础的方法与固定价格法相比具有更突出的地位。双组合拍卖是云计算中合理的资源分配方式之一。该方法包括确定赢家和资源分配两个阶段。本文提出了一种利用帝国主义竞争算法(ICA)确定双组合拍卖资源分配中标者的新方法。实验结果表明,在我们提出的新方法中,赢家用户的数量高于遗传算法。另一方面,在该算法中,遗传算法的赢家提供者数量更高。©2016 TAF出版社。版权所有。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Method to Winner Determination for Economic Resource Allocation in Cloud Computing Systems
Cloud computing systems are large-scale distributed systems, so that they focus more on large scale resource sharing, cooperation of several organizations and their use in new applications. One of the main challenges in this realm is resource allocation. There are many different ways of resource allocation in cloud computing. One of the common methods of resource allocation are economic methods. Among these methods, the auctionbased method has greater prominence compared with Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. This method includes two phases: winner determination and resource allocation. In this paper a new method has been presented to determine winner in double combinatorial auction-based resource allocation using Imperialist Competitive Algorithm (ICA). The experimental results show that in our new proposed method, the number of winner users is higher than genetic algorithm. On the other hand, in proposed algorithm, the number of winner providers is higher in genetic algorithm. © 2016 TAF Publishing. All rights reserved.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信