Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1984
Accession Number
ADA148027

Entities

People

  • Didier El Baz
  • Dimitri P. Bertsekas

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Asynchronous Computation
  • Computations
  • Continuity
  • Convergence
  • Electrical Engineering
  • Electronics Laboratories
  • Engineering
  • Guarantees
  • Information Systems
  • Intervals
  • Marine Corps
  • Military Research
  • Parallel Computing
  • Sequences
  • Time Intervals
  • Virginia

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Parallel and Distributed Computing.