On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time

We study the class of networks, which can be created in polylogarithmic parallel time by network constructors: groups of anonymous agents that interact randomly under a uniform random scheduler with the ability to form connections between each other. Starting from an empty network, the goal is to construct a stable network that belongs to a given family. We prove that the class of trees where each node has any k≥2 children can be constructed in O(logn) parallel time with high probability. We show that constructing networks that are k-regular is Ω(n) time, but a minimal relaxation to (l,k)-regular networks, where l=k−1, can be constructed in polylogarithmic parallel time for any fixed k, where k>2. We further demonstrate that when the finite-state assumption is relaxed and k is allowed to grow with n, then k=loglogn acts as a threshold above which network construction is, again, polynomial time. We use this to provide a partial characterisation of the class of polylogarithmic time network constructors.

Parallel time-stepping for fluid-structure interactions

We present a parallel time-stepping method for fluid-structure interactions. The interaction between the incompressible Navier-Stokes equations and a hyperelastic solid is formulated in a fully monolithic framework. Discretization in space is based on equal order finite element for all variables and a variant of the Crank-Nicolson scheme is used as second order time integrator. To accelerate the solution of the systems, we analyze a parallel-in time method. For different numerical test cases in 2d and in 3d we present the efficiency of the resulting solution approach. We also discuss some challenges and limitations that are connected to the special structure of fluid-structure interaction problem. In particular, we will investigate stability and dissipation effects of the time integration and their influence on the convergence of the Parareal method. It turns out that especially processes based on an internal dynamics (e.g. driven by the vortex street around an elastic obstacle) cause great difficulties. Configurations however, which are driven by oscillatory problem data, are well-suited for parallel time stepping and allow for substantial speedups.