Abstract
In this paper, we study the multi-node broadcast problem in hypercubes, that is an asynchronous and repetitive version of all-to-all broadcast problem. Suppose that nodes of a hypercube asynchronously broadcast a piece of information. They can asynchronously initiate their broadcasts while other broadcasts are in process. The multi-node broadcast problem is the problem of completing each of those broadcasts quickly. We propose several decentralized schemes for solving the problem. The effectiveness of the schemes is demonstrated by simulation.
Author supplied keywords
Cite
CITATION STYLE
Fujita, S., & Kashima, Y. (2000). Decentralized load balancing in multi-node broadcast schemes for hypercubes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1940, pp. 243–251). Springer Verlag. https://doi.org/10.1007/3-540-39999-2_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
