云计算中服务分配的并行连续双拍卖

Nima Farajian, Hossein Ebrahim pour-komleh
{"title":"云计算中服务分配的并行连续双拍卖","authors":"Nima Farajian, Hossein Ebrahim pour-komleh","doi":"10.18495/COMENGAPP.V4I2.125","DOIUrl":null,"url":null,"abstract":"Cloud Computing is a service oriented architecture in which every computing resources is delivered to users as a service. Nowadays market-oriented approach has attracted a lot of researchers because of its great ability to manage Cloud services efficiently and dynamically. Each service consists of various resources which all should be allocated to utilize the service. In this paper a parallel continuous double auction method for efficient service allocation in cloud computing is presented in which by using a novel parallel sorting algorithm at auctioneer, enables consumers to order various resources as workflow for utilizing requested services efficiently. Also in the presented method consumers and providers make bid and offer prices based on time factor. Experimental results show that proposed method is efficient in success rate, resource utilization and average connection time and also overall performance of system is improved by parallel approach.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Parallel Continuous Double Auction for Service Allocation in Cloud Computing\",\"authors\":\"Nima Farajian, Hossein Ebrahim pour-komleh\",\"doi\":\"10.18495/COMENGAPP.V4I2.125\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud Computing is a service oriented architecture in which every computing resources is delivered to users as a service. Nowadays market-oriented approach has attracted a lot of researchers because of its great ability to manage Cloud services efficiently and dynamically. Each service consists of various resources which all should be allocated to utilize the service. In this paper a parallel continuous double auction method for efficient service allocation in cloud computing is presented in which by using a novel parallel sorting algorithm at auctioneer, enables consumers to order various resources as workflow for utilizing requested services efficiently. Also in the presented method consumers and providers make bid and offer prices based on time factor. Experimental results show that proposed method is efficient in success rate, resource utilization and average connection time and also overall performance of system is improved by parallel approach.\",\"PeriodicalId\":120500,\"journal\":{\"name\":\"Computer Engineering and Applications\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Engineering and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18495/COMENGAPP.V4I2.125\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Engineering and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18495/COMENGAPP.V4I2.125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

云计算是一种面向服务的体系结构,其中每个计算资源都作为服务交付给用户。面向市场的方法以其高效、动态地管理云服务的能力吸引了众多研究者的关注。每个服务都由各种资源组成,所有这些资源都应该被分配以利用该服务。本文提出了一种用于云计算中服务高效分配的并行连续双拍卖方法,该方法通过在拍卖商处使用一种新颖的并行排序算法,使消费者能够将各种资源作为工作流进行排序,从而有效地利用所请求的服务。在该方法中,消费者和供应商根据时间因素进行出价和报价。实验结果表明,该方法在成功率、资源利用率、平均连接时间等方面具有较高的效率,并通过并行方式提高了系统的整体性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Parallel Continuous Double Auction for Service Allocation in Cloud Computing
Cloud Computing is a service oriented architecture in which every computing resources is delivered to users as a service. Nowadays market-oriented approach has attracted a lot of researchers because of its great ability to manage Cloud services efficiently and dynamically. Each service consists of various resources which all should be allocated to utilize the service. In this paper a parallel continuous double auction method for efficient service allocation in cloud computing is presented in which by using a novel parallel sorting algorithm at auctioneer, enables consumers to order various resources as workflow for utilizing requested services efficiently. Also in the presented method consumers and providers make bid and offer prices based on time factor. Experimental results show that proposed method is efficient in success rate, resource utilization and average connection time and also overall performance of system is improved by parallel approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fuzzy Logic-Ant Colony Optimization for Explorer-Follower Robot with Global Optimal Path Planning BLOB Analysis for Fruit Recognition and Detection Some Physical and Computational Features of Unloaded Power Transmission Lines' Switching-off Process A new method to improve feature selection with meta-heuristic algorithm and chaos theory Implementation Color Filtering and Harris Corner Method on Pattern Recognition System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1