A quick broadcasting algorithm in wormhole-routed multicomputers

Describes a broadcasting method in a wormhole-routed network, which begins by decomposing a source message into many small messages in a bisection style. Then it mixes them together at an exponential speed, by means of which it achieves less delay than current algorithms. The price is that it may require more external channels for flit transfer. To overcome this drawback, we combine it with the approach of Yu-Chee Tseng et al. (1999) in order to improve its efficiency. Moreover, we prove a theorem to demonstrate that our /spl gamma/ is optimal for the Exponential Symmetric Scattering Algorithm (ESSA). Finally, several applications are put forward. Further study is needed to make the method more complete, such as extending it to other network structures.