Distributed Computation of Fixed Points.

Abstract

We present an algorithmic model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumptions on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We provide a general convergence theorem for algorithms of this type, and demonstrate its applicability to several classes of problems including the calculation of fixed points of contraction and monotone mappings arising in linear and nonlinear systems of equations, shortest path problems, and dynamic programming. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1981
Accession Number
ADA104418

Entities

People

  • Dimitri P. Bertsekas

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Communication Networks
  • Computations
  • Computer Communications
  • Computer Programming
  • Convergence
  • Dynamic Programming
  • Equations
  • Information Exchange
  • Information Systems
  • Intervals
  • Iterations
  • Massachusetts
  • Nonlinear Systems
  • Security
  • Sequences
  • Time Intervals

Fields of Study

  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Linear Algebra
  • Parallel and Distributed Computing.