All-to-all Scatter in de Bruijn and Kautz Networks.

Available from STL Prague, CZ / NTK - National Technical LibrarySIGLECZCzech Republi

All-to-All Scatter in de Bruijn and Kautz Networks

In this paper, we describe algorithms for all-to-all scatter in all-port de Bruijn and Kautz networks. The algorithms are memory-optimal and asymptotically time- and transmission-optimal. We give algorithms for the noncombining model and their modifications for the limited combining model. The algorithms achieve asymptotic optimality on both store-and-forward and wormhole switched networks

Collective Communication Algorithms.

Communication algorithms (CA) play a critical role in the performance of many parallel algorithms developed for distributed-memory multiprocessors. Collective CA are one of the important groups of CA algorithms. This thesis first surveys recent results in the area of collective CA in orthogonal, tree-based, and shuffle-based networks. In the second part, several new results on CA for Kautz, de Bruijn, mesh-of-trees, and cube-connected-cycles topologies are given. The main results are: tight bounds on the average distance in Kautz directed and undirected graphs; a memory-optimal and asymptotically time-optimal alg. for all-to-all scatter in de Bruijn and Kautz networks assuming noncombining all-port communication model; an optimal alg. for broadcasting in square and rectangular meshes-of-trees networks assuming one-port distance-insensitive routing; asymptotically optimal alg. for gossiping in square and rectangular meshes-of-trees networks assuming combining one-port distance-insensitive routing for both half- and full-duplex links; optimal alg. for broadcasting in square and rectangular meshes-of-trees networks assuming all-output-port distance-insensitive routing; an optimal alg. for broadcasting in cube 3-D meshes-of-trees networks assuming all-output-port distance-insensitive routing; an asymptotically optimal alg. for broadcasting in cube-connected-cycles networks assuming all-output-port distance-insensitive routing.Available from STL Prague, CZ / NTK - National Technical LibrarySIGLECZCzech Republi