S. Jeyalaksshmi, M. S. Nidhya, G. Suseendran, Souvik Pal, D. Akila
{"title":"Developing Mapping and allotment in Volunteer Cloud systems using Reliability Profile algorithms in a virtual machine","authors":"S. Jeyalaksshmi, M. S. Nidhya, G. Suseendran, Souvik Pal, D. Akila","doi":"10.1109/iccakm50778.2021.9357710","DOIUrl":null,"url":null,"abstract":"While the placement of the Virtual Computer was It remains an open challenge for Volunteer Cloud Computing, which reveals many divergent gaps in conventional cloud computing contexts, and has been thoroughly studied. Features, including sporadic usability of nodes and Infrastructure that's inefficient. In this article, we are modeling the Virtual In Volunteer Cloud Computing, computer positioning dilemma As a multi-dimensional, constrained 0–1 knapsack issue and Built algorithms to satisfy the basic aims and shortcomings of Volunteer Cloud Computing. The proof of a dedicated Cloud Computing Volunteer, The competitive success outcomes of these test beds are illustrated With algorithm.","PeriodicalId":165854,"journal":{"name":"2021 2nd International Conference on Computation, Automation and Knowledge Management (ICCAKM)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Conference on Computation, Automation and Knowledge Management (ICCAKM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccakm50778.2021.9357710","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
While the placement of the Virtual Computer was It remains an open challenge for Volunteer Cloud Computing, which reveals many divergent gaps in conventional cloud computing contexts, and has been thoroughly studied. Features, including sporadic usability of nodes and Infrastructure that's inefficient. In this article, we are modeling the Virtual In Volunteer Cloud Computing, computer positioning dilemma As a multi-dimensional, constrained 0–1 knapsack issue and Built algorithms to satisfy the basic aims and shortcomings of Volunteer Cloud Computing. The proof of a dedicated Cloud Computing Volunteer, The competitive success outcomes of these test beds are illustrated With algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
