Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
- 1 October 1984
- report
- Published by Defense Technical Information Center (DTIC)
Abstract
This document considers the solution of the single commodity strictly convey network flow problem in a distributed asynchronous computation environment. The dual of this problem is unconstrained, differentiable, and well suited for solution via Gauss-Seidel relaxation. It is shown that the structure of the dual allows the successful application of a distributed asynchronous method whereby relaxation iterations are carried out in parallel by several processors in arbitrary order and with arbitrarily large interprocessor communication delays.Keywords
This publication has 0 references indexed in Scilit: