在虚拟机中使用可靠性概要算法开发志愿者云系统中的映射和分配

S. Jeyalaksshmi, M. S. Nidhya, G. Suseendran, Souvik Pal, D. Akila
{"title":"在虚拟机中使用可靠性概要算法开发志愿者云系统中的映射和分配","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":"{\"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}","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

摘要

虽然虚拟计算机的位置仍然是志愿者云计算的一个公开挑战,这揭示了传统云计算环境中的许多分歧,并且已经被彻底研究过。功能,包括节点和基础设施的零星可用性,效率低下。在本文中,我们将志愿者云计算中的虚拟、计算机定位困境建模为一个多维、受限的0-1背包问题,并构建算法来满足志愿者云计算的基本目标和不足。一个专门的云计算志愿者的证明,用算法说明了这些试验台的竞争成功结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Developing Mapping and allotment in Volunteer Cloud systems using Reliability Profile algorithms in a virtual machine
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信