{"title":"故障超立方体中算法的嵌入、通信和性能","authors":"Jin-Kun Wang, F. Ozguner","doi":"10.1109/DMCC.1990.556409","DOIUrl":null,"url":null,"abstract":"In many parallel algorithms in hypercubes, linear arrays and 2-D meshes are embedded for the computations that require local communication while the hypercube topology is used for global communication. In this paper, embedding and global data communication schemes are developed for faulty hypercubes and studied in the context of algorithms. The schemes are also applicable to incomplete hypercubes resulting from the allocation of subcubes to different users.","PeriodicalId":204431,"journal":{"name":"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Embeddings, Communication and Performance of Algorithms in Faulty Hypercubes\",\"authors\":\"Jin-Kun Wang, F. Ozguner\",\"doi\":\"10.1109/DMCC.1990.556409\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In many parallel algorithms in hypercubes, linear arrays and 2-D meshes are embedded for the computations that require local communication while the hypercube topology is used for global communication. In this paper, embedding and global data communication schemes are developed for faulty hypercubes and studied in the context of algorithms. The schemes are also applicable to incomplete hypercubes resulting from the allocation of subcubes to different users.\",\"PeriodicalId\":204431,\"journal\":{\"name\":\"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DMCC.1990.556409\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMCC.1990.556409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Embeddings, Communication and Performance of Algorithms in Faulty Hypercubes
In many parallel algorithms in hypercubes, linear arrays and 2-D meshes are embedded for the computations that require local communication while the hypercube topology is used for global communication. In this paper, embedding and global data communication schemes are developed for faulty hypercubes and studied in the context of algorithms. The schemes are also applicable to incomplete hypercubes resulting from the allocation of subcubes to different users.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
