Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems - Archive ouverte HAL Access content directly
Journal Articles SIAM Journal on Control and Optimization Year : 1987

Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems

(1) , (2)
1
2
Dimitri P. Bertsekas
  • Function : Author
  • PersonId : 966453
Didier El Baz

Abstract

We consider the solution of the single commodity strictly convex 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. We show 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.
Fichier principal
Vignette du fichier
P-1417-15607542.pdf (1.01 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01151751 , version 1 (15-05-2015)

Identifiers

Cite

Dimitri P. Bertsekas, Didier El Baz. Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems. SIAM Journal on Control and Optimization, 1987, 25 (1), pp.74-85. ⟨10.1137/0325006⟩. ⟨hal-01151751⟩
71 View
61 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More