Run this notebook online: or Colab:

# 12.4. Parameter Servers¶

As we move from single GPUs to multiple GPUs and then to multiple servers containing multiple GPUs, possibly all spread out across multiple racks and network switches our algorithms for distributed and parallel training need to become much more sophisticated. Details matter since different interconnects have very different bandwidth (e.g., NVLink can offer up to 100GB/s across 6 links in an appropriate setting, PCIe 3.0 16x lanes offer 16GB/s while even high speed 100 GbE Ethernet only amounts to 10GB/s). At the same time it is unreasonable to expect that a statistical modeler be an expert in networking and systems.

The core idea of the parameter server was introduced in [Smola & Narayanamurthy, 2010] in the context of distributed latent variable models. A description of the push and pull semantics then followed in [Ahmed et al., 2012] and a description of the system and an open source library followed in [Li et al., 2014]. In the following we will motivate the components needed for efficiency.

## 12.4.1. Data Parallel Training¶

Let us review the data parallel training approach to distributed training. We will use this to the exclusion of all others in this section since it is significantly simpler to implement in practice. There are virtually no use cases (besides deep learning on graphs) where any other strategy for parallelism is preferred since GPUs have plenty of memory nowadays. Section 12.4.1 describes the variant of data parallelism that we implemented in the previous section. The key aspect in it is that the aggregation of gradients occurs on GPU0 before the updated parameters are rebroadcast to all GPUs.

In retrospect, the decision to aggregate on GPU0 seems rather ad-hoc. After all, we might just as well aggregate on the CPU. In fact, we could even decide to aggregate some of the parameters on one GPU and some others on another. Provided that the optimization algorithm supports this, there is no real reason for why we could not. For instance, if we have four parameter vectors \(\mathbf{v}_1, \ldots, \mathbf{v}_4\) with associated gradients \(\mathbf{g}_1, \ldots, \mathbf{g}_4\) we could aggregate the gradients on one GPU each.

This reasoning seems arbitrary and frivolous. After all, the math is the
same throughout. However, we are dealing with real physical hardware
where different buses have different bandwidth as discussed in
Section 12.2. Consider a real 4-way GPU server as described
in `fig_bw_hierarchy`

. If it is particularly well connected,
it might have a 100 GbE network card. More typical numbers are in the
1-10 GbE range with an effective bandwidth of 100MB/s to 1GB/s. Since
the CPUs have too few PCIe lanes to connect to all GPUs directly (e.g.,
consumer grade Intel CPUs have 24 lanes) we need a
multiplexer.
The bandwidth from the CPU on a 16x Gen3 link is 16GB/s. This is also
the speed at which *each* of the GPUs is connected to the switch. This
means that it is more effective to communicate between the

.. _fig_bw_hierarchy:

For the sake of the argument let us assume that the gradients ‘weigh’
160MB. In this case it takes 30ms to send the gradients from all 3
remaining GPUs to the fourth one (each transfer takes 10ms = 160MB / 16
GB/s). Add another 30ms to transmit the weight vectors back we arrive at
a total of 60ms. If we send all data to the CPU we incur a penalty of
40ms since *each* of the four GPUs needs to send the data to the CPU,
yielding a total of 80ms. Lastly assume that we are able to split the
gradients into 4 parts of 40MB each. Now we can aggregate each of the
parts on a different GPU *simultaneously* since the PCIe switch offers a
full-bandwidth operation between all links. Instead of 30ms this takes
7.5ms, yielding a total of 15ms for a synchronization operation. In
short, depending on how we synchronize parameters the same operation can
take anywhere from 15ms to 80ms. `fig_ps_distributed`

depicts
the different strategies for exchanging parameters.

.. _fig_ps_distributed:

Note that we have yet another tool at our disposal when it comes to improving performance: in a deep network it takes some time to compute all gradients from the top to the bottom. We can begin synchronizing gradients for some parameter groups even while we are still busy computing them for others (the technical details for that are somewhat involved). See e.g., [Sergeev & DelBalso, 2018] for details on how to do this in Horovod.

## 12.4.2. Ring Synchronization¶

When it comes to synchronization on modern deep learning hardware we often encounter significantly bespoke network connectivity. For instance, the AWS P3.16xlarge and NVIDIA DGX-2 instances share the connectivity structure of Section 12.4.2. Each GPU connects to a host CPU via a PCIe link which operates at best at 16 GB/s. Additionally each GPU also has 6 NVLink connections, each of which is capable of transferring 300 Gbit/s bidirectionally. This amounts to around 18 GB/s per link per direction. In short, the aggregate NVLink bandwidth is significantly higher than the PCIe bandwidth. The question is how to use it most efficiently.

It turns out [Wang et al., 2018] that the optimal synchronization strategy is to decompose the network into two rings and to use them to synchronize data directly. Section 12.4.2 illustrates that the network can be decomposed into one ring (1-2-3-4-5-6-7-8-1) with double NVLink bandwidth and into one (1-4-6-3-5-8-2-7-1) with regular bandwidth. Designing an efficient synchronization protocol in this case is nontrivial.

Consider the following thought experiment: given a ring of \(n\)
compute nodes (or GPUs) we can send gradients from the first to the
second node. There it is added to the local gradient and sent on to the
third node, and so on. After \(n-1\) steps the aggregate gradient
can be found in the last-visited node. That is, the time to aggregate
gradients grows linearly with the number of nodes. But if we do this the
algorithm is quite inefficient. After all, at any time there is only one
of the nodes communicating. What if we broke the gradients into
\(n\) chunks and started synchronizing chunk \(i\) starting at
node \(i\). Since each chunk is of site \(1/n\) the total time
is now \((n-1)/n \approx 1\). In other words, the time spent to
aggregate gradients *does not grow* as we increase the size of the ring.
This is quite an astonishing result. `fig_ringsync`

illustrates the sequence of steps on \(n=4\) nodes.

.. _fig_ringsync:

If we use the same example of synchronizing 160MB across 8 V100 GPUs we arrive at approximately \(2 \cdot 160 \mathrm{MB} / (3 \cdot 18 \mathrm{GB/s}) \approx 6 \mathrm{ms}\) This is quite a bit better than using the PCIe bus, even though we are now using 8 GPUs. Note that in practice these numbers are quite a bit worse, since deep learning frameworks often fail to assemble communication into large burst transfers. Moreover, timing is critical. Note that there is a common misconception that ring synchronization is fundamentally different from other synchronization algorithms. The only difference is that the synchronization path is somewhat more elaborate when compared to a simple tree.

## 12.4.3. Multi-Machine Training¶

Distributed training on multiple machines adds a further challenge: we
need to communicate with servers that are only connected across a
comparatively lower bandwidth fabric which can be over an order of
magnitude slower in some cases. Synchronization across devices is
tricky. After all, different machines running training code will have
subtly different speed. Hence we need to *synchronize* them if we want
to use synchronous distributed optimization.
Section 12.4.3 illustrates how distributed parallel
training occurs.

A (different) batch of data is read on each machine, split across multiple GPUs and transferred to GPU memory. There predictions and gradients are computed on each GPU batch separately.

The gradients from all local GPUs are aggregated on one GPU (or alternatively parts of it are aggregated over different GPUs.

The gradients are sent to the CPU.

The CPU sends the gradients to a central parameter server which aggregates all the gradients.

The aggregate gradients are then used to update the weight vectors and the updated weight vectors are broadcast back to the individual CPUs.

The information is sent to one (or multiple) GPUs.

The updated weight vectors are spread across all GPUs.

Each of these operations seems rather straightforward. And, indeed, they
can be carried out efficiently *within* a single machine. Once we look
at multiple machines, though, we can see that the central parameter
server becomes the bottleneck. After all, the bandwidth per server is
limited, hence for \(m\) workers the time it takes to send all
gradients to the server is \(O(m)\). We can break through this
barrier by increasing the number of servers to \(n\). At this point
each server only needs to store \(O(1/n)\) of the parameters, hence
the total time for updates and optimization becomes \(O(m/n)\).
Matching both numbers yields constant scaling regardless of how many
workers we are dealing with. In practice we use the *same* machines both
as workers and as servers. `fig_ps_multips`

illustrates the
design. See also [Li et al., 2014] for details. In
particular, ensuring that multiple machines work without unreasonable
delays is nontrivial. We omit details on barriers and will only briefly
touch on synchronous and asynchronous updates below.

.. _fig_ps_multips:

## 12.4.4. (key,value) Stores¶

Implementing the steps required for distributed multi-GPU training in practice is nontrivial. In particular, given the many different choices that we might encounter. This is why it pays to use a common abstraction, namely that of a (key,value) store with redefined update semantics. Across many servers and many GPUs the gradient computation can be defined as

The key aspect in this operation is that it is a *commutative
reduction*, that is, it turns many vectors into one and the order in
which the operation is applied does not matter. This is great for our
purposes since we do not (need to) have fine grained control over when
which gradient is received. Note that it is possible for us to perform
the reduction stagewise. Furthermore, note that this operation is
independent between blocks \(i\) pertaining to different parameters
(and gradients).

This allows us to define the following two operations: push, which accumulates gradients, and pull, which retrieves aggregate gradients. Since we have many different sets of gradients (after all, we have many layers), we need to index the gradients with a key \(i\). This similarity to (key,value) stores, such as the one introduced in Dynamo [DeCandia et al., 2007] is not by coincidence. They, too, satisfy many similar characteristics, in particular when it comes to distributing the parameters across multiple servers.

**push(key, value)**sends a particular gradient (the value) from a worker to a common storage. There the parameter is aggregated, e.g., by summing it up.**pull(key, value)**retrieves an aggregate parameter from common storage, e.g., after combining the gradients from all workers.

By hiding all the complexity about synchronization behind a simple push and pull operation we can decouple the concerns of the statistical modeler who wants to be able to express optimization in simple terms and the systems engineer who needs to deal with the complexity inherent in distributed synchronization. In the next section we will experiment with such a (key,value) store in practice.

## 12.4.5. Summary¶

Synchronization needs to be highly adaptive to specific network infrastructure and connectivity within a server. This can make a significant difference to the time it takes to synchronize.

Ring-synchronization can be optimal for P3 and DGX-2 servers. For others possibly not so much.

A hierarchical synchronization strategy works well when adding multiple parameter servers for increased bandwidth.

Asynchronous communication (while computation is still ongoing) can improve performance.

## 12.4.6. Exercises¶

Can you increase the ring synchronization even further? Hint: you can send messages in both directions.

Fully asynchronous. Some delays permitted?

Fault tolerance. How? What if we lose a server? Is this a problem?

Checkpointing

Tree aggregation. Can you do it faster?

Other reductions (commutative semiring).