{"title":"分布式系统中最优全对全广播方案","authors":"Ming-Syan Chen, Philip S. Yu, Kun-Lung Wu","doi":"10.1109/PDIS.1991.183111","DOIUrl":null,"url":null,"abstract":"Broadcasting, which refers to a process of information dissemination in a distributed system whereby a message originating from a certain node is sent to all other nodes in the system, is a very important issue in distributed computing. All-to-all broadcasting means the process by which every node broadcasts its certain piece of information to all other nodes. The authors develop optimal all-to-all broadcasting schemes for a distributed system of an arbitrary number of nodes to complete the broadcasting with not only the minimal number of communication steps but also the minimal number of messages. They develop the optimal all-to-all broadcasting scheme for the case of k-port communication, meaning that each node can send out k messages in one communication step where k is a positive integer depending on the system. It is shown that the proposed scheme not only requires the minimal number of communication steps but also incurs the minimal number of messages.<<ETX>>","PeriodicalId":210800,"journal":{"name":"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1991-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimal all-to-all broadcasting schemes in distributed systems\",\"authors\":\"Ming-Syan Chen, Philip S. Yu, Kun-Lung Wu\",\"doi\":\"10.1109/PDIS.1991.183111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Broadcasting, which refers to a process of information dissemination in a distributed system whereby a message originating from a certain node is sent to all other nodes in the system, is a very important issue in distributed computing. All-to-all broadcasting means the process by which every node broadcasts its certain piece of information to all other nodes. The authors develop optimal all-to-all broadcasting schemes for a distributed system of an arbitrary number of nodes to complete the broadcasting with not only the minimal number of communication steps but also the minimal number of messages. They develop the optimal all-to-all broadcasting scheme for the case of k-port communication, meaning that each node can send out k messages in one communication step where k is a positive integer depending on the system. It is shown that the proposed scheme not only requires the minimal number of communication steps but also incurs the minimal number of messages.<<ETX>>\",\"PeriodicalId\":210800,\"journal\":{\"name\":\"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDIS.1991.183111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDIS.1991.183111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal all-to-all broadcasting schemes in distributed systems
Broadcasting, which refers to a process of information dissemination in a distributed system whereby a message originating from a certain node is sent to all other nodes in the system, is a very important issue in distributed computing. All-to-all broadcasting means the process by which every node broadcasts its certain piece of information to all other nodes. The authors develop optimal all-to-all broadcasting schemes for a distributed system of an arbitrary number of nodes to complete the broadcasting with not only the minimal number of communication steps but also the minimal number of messages. They develop the optimal all-to-all broadcasting scheme for the case of k-port communication, meaning that each node can send out k messages in one communication step where k is a positive integer depending on the system. It is shown that the proposed scheme not only requires the minimal number of communication steps but also incurs the minimal number of messages.<>