International audienceThis paper presents two simple all-to-all broadcasting algorithms on honeycomb mesh. Consider a network with n processors, one has personalized routing strategy at each node and it requires a 3n communication time complexity. This communication time can be reduced to n because the computation time is always assumed to be much lower than the communication time. The other is based on a Hamiltonian path and has a 2n communication time complexity. We show how they can be used to get parallel solutions to a class of problems on honeycomb networks, among others Prefix Sums, Maximal Vectors, Maximal Sum Subsegment, Parenthesis Matching, Decoding Binary Tree, and Sorting. In our knowledge, these all-to-all broadcast algorithms...
Caption title. "May 1987."Includes bibliographical references.Supported in part by Codex Corporation...
E cient interprocessor communication is crucial to increasing the performance of parallel computers....
© 1992 IEEE. In this paper, we address two different communication problems in multiprocessor system...
All-to-all personalized communication is a class of permutations in which each processor sends a uni...
AbstractSome generalized communication modes enabling the dissemination of information among process...
Broadcasting (one-to-all) and gossiping (all-to-all) are two major communication paradigms that were...
Some generalized communication modes enabling the dissemination of information among processors of i...
We consider the broadcasting operation in point-to-point packer-switched parallel and distributed ne...
Maximising the performance of parallel systems requires matching message-passing algorithms and appl...
Includes bibliographical references (p. 9-10).Cover title.Research supported by the NSF. ECS-8552419...
[[abstract]]Some common guidelines that can be used to design parallel algorithms under the single-c...
International audienceWe define the higher dimensional honeycomb graphs as a generalization of hexag...
Broadcasting is an information dissemination problem in which information originating at one node of...
Dynamic broadcast is a communication problem where each node in a parallel computer generates packet...
The communication modes (one-way and two-way mode) used for disseminating information among processo...
Caption title. "May 1987."Includes bibliographical references.Supported in part by Codex Corporation...
E cient interprocessor communication is crucial to increasing the performance of parallel computers....
© 1992 IEEE. In this paper, we address two different communication problems in multiprocessor system...
All-to-all personalized communication is a class of permutations in which each processor sends a uni...
AbstractSome generalized communication modes enabling the dissemination of information among process...
Broadcasting (one-to-all) and gossiping (all-to-all) are two major communication paradigms that were...
Some generalized communication modes enabling the dissemination of information among processors of i...
We consider the broadcasting operation in point-to-point packer-switched parallel and distributed ne...
Maximising the performance of parallel systems requires matching message-passing algorithms and appl...
Includes bibliographical references (p. 9-10).Cover title.Research supported by the NSF. ECS-8552419...
[[abstract]]Some common guidelines that can be used to design parallel algorithms under the single-c...
International audienceWe define the higher dimensional honeycomb graphs as a generalization of hexag...
Broadcasting is an information dissemination problem in which information originating at one node of...
Dynamic broadcast is a communication problem where each node in a parallel computer generates packet...
The communication modes (one-way and two-way mode) used for disseminating information among processo...
Caption title. "May 1987."Includes bibliographical references.Supported in part by Codex Corporation...
E cient interprocessor communication is crucial to increasing the performance of parallel computers....
© 1992 IEEE. In this paper, we address two different communication problems in multiprocessor system...