The distributed-memory implementation of the aggregated finite element method has been considered in [1]}. The proposed implementation starts with a standard distributed implementation of the finite element method that relies on a sub-mesh partition (with gluing info, e.g., via one layer of neighbor elements). First, one must parallelize the aggregation algorithm. The parallel implementation of this step is straightforward; one needs to perform nearest neighbor communications at the end of each iteration of the aggregation algorithm to propagate information. The result is identical to the serial version (see [1]}).
