Abstract

This paper is a study of one-to-all and all-to-all data movement patterns on cycles and multidimensional toroidal meshes that use cut-through (e.g., circuit-switched, wormhole) routing with virtual channels. We present new cut-through algorithms for broadcasting, scattering, gossiping, and multi-scattering on cycles and multi-dimensional torus networks. Our algorithms use virtual channels to improve performance by controlled use of channel conflicts. We compare our algorithms to the best known store-and-forward algorithms, cut-through algorithms, and lower bounds. In most cases, we conclude that cut-through routing is best when messages are "short" and store-and-forward routing is best for long messages. Some of our new algorithms outperform all known algorithms for all message lengths. Keywords: torus networks, cut-through routing, broadcasting, gossiping, scattering, multi-scattering AMS (MOS) subject classifications: 94A05, 68M10 This work was done while the first author was visi...

Citations