{"title":"一类光多级网络中最优全对全个性化交换","authors":"Yuanyuan Yang, Jianchao Wang","doi":"10.1109/IPDPS.2000.846061","DOIUrl":null,"url":null,"abstract":"All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper, we look into the issue of realizing all-to-all personalized exchange in optical multistage networks. Advances in electro-optic technologies have made optical communication a promising networking choice to meet the increasing demands for high channel bandwidth and low communication latency of high-performance computing/communication applications. Although optical multistage networks hold great promise and have demonstrated advantages over their electronic counterpart, they also hold their own challenges. Due to the unique properties of optics, crosstalk in optical switches should be avoided to make them work properly. In this paper, we will provide an optimal scheme for realizing all-to-all personalized exchange in a class of unique-path, self-routing optical multistage networks crosstalk-free. The basic idea of realizing all-to-all personalized exchange in such a multistage network is to transform it to multiple semi-permutations, each of which can be realized crosstalk-free in a single pass, and take advantage of pipelined message transmission in consecutive passes. As can be seen, the time complexity of our all-to-all personalized exchange algorithms matches the lower bound of the communication delay in this type of network.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":"{\"title\":\"Optimal all-to-all personalized exchange in a class of optical multistage networks\",\"authors\":\"Yuanyuan Yang, Jianchao Wang\",\"doi\":\"10.1109/IPDPS.2000.846061\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper, we look into the issue of realizing all-to-all personalized exchange in optical multistage networks. Advances in electro-optic technologies have made optical communication a promising networking choice to meet the increasing demands for high channel bandwidth and low communication latency of high-performance computing/communication applications. Although optical multistage networks hold great promise and have demonstrated advantages over their electronic counterpart, they also hold their own challenges. Due to the unique properties of optics, crosstalk in optical switches should be avoided to make them work properly. In this paper, we will provide an optimal scheme for realizing all-to-all personalized exchange in a class of unique-path, self-routing optical multistage networks crosstalk-free. The basic idea of realizing all-to-all personalized exchange in such a multistage network is to transform it to multiple semi-permutations, each of which can be realized crosstalk-free in a single pass, and take advantage of pipelined message transmission in consecutive passes. As can be seen, the time complexity of our all-to-all personalized exchange algorithms matches the lower bound of the communication delay in this type of network.\",\"PeriodicalId\":206541,\"journal\":{\"name\":\"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000\",\"volume\":\"87 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"37\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPDPS.2000.846061\",\"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 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPS.2000.846061","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal all-to-all personalized exchange in a class of optical multistage networks
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper, we look into the issue of realizing all-to-all personalized exchange in optical multistage networks. Advances in electro-optic technologies have made optical communication a promising networking choice to meet the increasing demands for high channel bandwidth and low communication latency of high-performance computing/communication applications. Although optical multistage networks hold great promise and have demonstrated advantages over their electronic counterpart, they also hold their own challenges. Due to the unique properties of optics, crosstalk in optical switches should be avoided to make them work properly. In this paper, we will provide an optimal scheme for realizing all-to-all personalized exchange in a class of unique-path, self-routing optical multistage networks crosstalk-free. The basic idea of realizing all-to-all personalized exchange in such a multistage network is to transform it to multiple semi-permutations, each of which can be realized crosstalk-free in a single pass, and take advantage of pipelined message transmission in consecutive passes. As can be seen, the time complexity of our all-to-all personalized exchange algorithms matches the lower bound of the communication delay in this type of network.