Speeding up parallel GROMACS on high‐latency networks

We investigate the parallel scaling of the GROMACS molecular dynamics code on Ethernet Beowulf clusters and what prerequisites are necessary for decent scaling even on such clusters with only limited bandwidth and high latency. GROMACS 3.3 scales well on supercomputers like the IBM p690 (Regatta) and on Linux clusters with a special interconnect like Myrinet or Infiniband. Because of the high single‐node performance of GROMACS, however, on the widely used Ethernet switched clusters, the scaling typically breaks down when more than two computer nodes are involved, limiting the absolute speedup that can be gained to about 3 relative to a single‐CPU run. With the LAM MPI implementation, the main scaling bottleneck is here identified to be the all‐to‐all communication which is required every time step. During such an all‐to‐all communication step, a huge amount of messages floods the network, and as a result many TCP packets are lost. We show that Ethernet flow control prevents network congestion and leads to substantial scaling improvements. For 16 CPUs, e.g., a speedup of 11 has been achieved. However, for more nodes this mechanism also fails. Having optimized an all‐to‐all routine, which sends the data in an ordered fashion, we show that it is possible to completely prevent packet loss for any number of multi‐CPU nodes. Thus, the GROMACS scaling dramatically improves, even for switches that lack flow control. In addition, for the common HP ProCurve 2848 switch we find that for optimum all‐to‐all performance it is essential how the nodes are connected to the switch's ports. This is also demonstrated for the example of the Car‐Parinello MD code. © 2007 Wiley Periodicals, Inc. J Comput Chem, 2007