A distributed algorithm for convex network optimization problems (Q1104052)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1104052 |
scientific article; zbMATH DE number 4054940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A distributed algorithm for convex network optimization problems |
scientific article; zbMATH DE number 4054940 |
Statements
A distributed algorithm for convex network optimization problems (English)
0 references
1988
0 references
Parallel computer architectures add a new dimension to the problem of network optimization. In this paper a synchron relaxation algorithm for convex network optimization problems is proposed that lends itself for processing in a distributed or parallel environment. The algorithm based on the k-coloring properties of the network graph. Lower bounds for its performance when implemented in a distributed environment are developed and the method is evaluated empirically using simulation on a sequential machine.
0 references
Gauss-Seidel type relaxation techniques
0 references
distributed systems
0 references
parallel systems
0 references
network optimization
0 references
synchron relaxation algorithm
0 references
network graph
0 references
0.8152313828468323
0 references
0.8142243027687073
0 references
0.8101627826690674
0 references
0.8101627826690674
0 references
