User:Tgeorge44/sandbox

In parallel computing, all-to-all (also known as index operation or total exchange) is a collective operation, where each processor sends an individual message to every other processor.

Initially, each processor holds p messages of size m each, and the goal is to exchange the i-th message of processor j with the j-th message of processor i. A visualization for four processesors performing an all-to-all operation with m=1 is given in Figure 1.

The number of communication rounds and the overall communication volume are measures to evaluate the quality of an all-to-all algorithm. We consider a single-ported full-duplex machine throughout this article. On such a machine, an all-to-all algorithm requires atleast $\lceil \log _{2}n\rceil$ communication rounds. Further a minimum of $\left\lceil {\frac {m(n-1)}{k}}\right\rceil$ units of data is transfered. Optimum for both these measures can not be achieved simultanously.

Depending on the network topology (fully connected, hypercube, ring), different all-to-all algorithms are required.

All-to-all algorithms based on topology

Visualization of an all-to-all algorithm in a ring topology.

Visualization of an all-to-all algorithm in a mesh topology.

We consider a single-ported machine. The way the data is routed through the network depends on its underlying topology. We take a look at all-to-all algorithms for common network topologies.

Hypercube

See Hubercube article.

A hypercube is a network topology, where two processors share a link, if the hammming distance of their indizies is one. The idea of an all-to-all algorithm is to combine messages belonging to the same subcube, and then distribute them.

Ring

An all-to-all algorithm in a ring topology is very intuitive. Initially a processor sends a message of size m(p-1) to one of its neighbors. Communication is performed in the same direction on all processors. When a processor receives a message, he extracts the part that belongs to him and forwards the remainder of the message to the next neighbor. After (p-1) communication rounds, every message is distributed to its destination.

The time taken by this algorithm is $(t_{s}+{\frac {1}{2}}t_{w}mp)(p-1)$. Here $t_{s}$ is the startup cost for a communication, and $t_{w}$ is the cost of transmitting a unit of data. This term can further be improved when half of the messages are sent in one and the other half in the other direction. This way, messages arrive earlier at their destination.

Mesh

For a mesh we look at a ${\sqrt {p}}\times {\sqrt {p}}$ mesh. This algorithm is easily adaptable for any mesh. An all-to-all algorithm in a mesh consists of two communication phases. First, each processors groups the messages into ${\sqrt {p}}$ groups, each containing ${\sqrt {p}}$ messages. Messages are in the same group, if their destined processors share the same row. Next, an all-to-all operation among rows is performed. Each processor now holds all relevant information for processors in his column. Again, the messages need to be rearranged. After another all-to-all operation, this time in respect to columns, each processor ends up with its messages.

The overall time of communication for this algorithm is $(2t_{s}+t_{w}mp)({\sqrt {p}}-1)$. Additionally, time for the local rearrangment of messages adds to the overall runtime of the algorithm.

1-factor algorithm

A visualization of the 1-factor algorithm.

Again, we consider a single-ported machine. A trivial algorithm, is to send (p-1) asynchronous messages into the network for each processor. The performance of this algorithm is poor, which is due to congestion arising because of the bisection width of the network. More sophisticated algorithms combine messages to reduce the number of send operations and try to control congestion.

For large messages, the cost of a startup is small compared to the cost of transmitting the payload. It is faster to send messages directly to their destination. In the following algorithm an all-to-all algorithm is performed using (p-1) one-to-one routings.

  //p odd:
  // pe index $j\in \{0,\dots ,p-1\}$
  for i:=0 to p-1 do
   Exchange data with PE $(i-j)\,\mod \,p$

  //p even:
  // pe index $j\in \{0,\dots ,p-1\}$
  for i:=0 to p-2 do
   idle:=${\frac {p}{2}}i\,\mod \,(p-1)$
   if j=p-1 then exchange data with PE idle
   else 
    if j=idle then
     exchange data with pe p-1
    else
      exchange data with PE $(i-j)mod(p-1)$
  

The algorithm has a different behavior, whether p is odd or even. In case p is odd, each iteration one processor is idle. For an even p, this idle processor communicates with the processor with index p-1. The total time taken is $(p-1)(t_{s}+t_{w}m)$ for an even p, and $p(t_{s}+t_{w}m)$ for an odd p respectively.

Instead of pairing processor j with processor $(i-j)\mod p$ in iteration i, we can also use the exclusive-or of j and i to determine a mapping. This approach requires p to be a power of two. Depending on the underlying topology of the network, one approach might be superior to the other. The exclusive or approach is superior, when performing pairwise one-to-one routings in a hypercube or fat-tree.