On Unbounded Delays in Asynchronous Parallel Fixed-Point Algorithms

Understand

The need for scalable numerical solutions has motivated the development of asynchronous parallel algorithms, where a set of nodes run in parallel with little or no synchronization, thus computing with delayed information.

• This paper studies the convergence of the asynchronous parallel algorithm ARock under potentially unbounded delays.
• ARock is a general asynchronous algorithm that has many applications.
• It parallelizes fixed-point iterations by letting a set of nodes randomly choose solution coordinates and update them in an asynchronous parallel fashion.