{"title":"面向并行志愿计算的通信组动态重构方法","authors":"Taiki Tomita, Keiichi Inohara, Yota Kurokawa, Masaru Fukushi","doi":"10.1109/NaNA56854.2022.00093","DOIUrl":null,"url":null,"abstract":"This paper deals with a challenging issue of realizing parallel Volunteer Computing (VC) environments on the Internet. Due to the nature of volatility of participant nodes, current VC supports only distributed computing, which limits the widespread use of VC. To solve this problem, this paper defines a redundant parallel VC model consisting of several node groups, called communication groups, and propose a dynamic reconfiguration method of communication groups. The proposed method consists of three procedures which function in a decentralized manner to cope with the volatility of nodes. Experimental result shows that the proposed method works effective in the environments where join and defection rates are relatively high.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Dynamic Reconfiguration Method of Communication Groups for Parallel Volunteer Computing\",\"authors\":\"Taiki Tomita, Keiichi Inohara, Yota Kurokawa, Masaru Fukushi\",\"doi\":\"10.1109/NaNA56854.2022.00093\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with a challenging issue of realizing parallel Volunteer Computing (VC) environments on the Internet. Due to the nature of volatility of participant nodes, current VC supports only distributed computing, which limits the widespread use of VC. To solve this problem, this paper defines a redundant parallel VC model consisting of several node groups, called communication groups, and propose a dynamic reconfiguration method of communication groups. The proposed method consists of three procedures which function in a decentralized manner to cope with the volatility of nodes. Experimental result shows that the proposed method works effective in the environments where join and defection rates are relatively high.\",\"PeriodicalId\":113743,\"journal\":{\"name\":\"2022 International Conference on Networking and Network Applications (NaNA)\",\"volume\":\"127 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Networking and Network Applications (NaNA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NaNA56854.2022.00093\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Networking and Network Applications (NaNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaNA56854.2022.00093","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Dynamic Reconfiguration Method of Communication Groups for Parallel Volunteer Computing
This paper deals with a challenging issue of realizing parallel Volunteer Computing (VC) environments on the Internet. Due to the nature of volatility of participant nodes, current VC supports only distributed computing, which limits the widespread use of VC. To solve this problem, this paper defines a redundant parallel VC model consisting of several node groups, called communication groups, and propose a dynamic reconfiguration method of communication groups. The proposed method consists of three procedures which function in a decentralized manner to cope with the volatility of nodes. Experimental result shows that the proposed method works effective in the environments where join and defection rates are relatively high.