1995
DOI: 10.1090/dimacs/022/04
|View full text |Cite
|
Sign up to set email alerts
|

A data parallel space dilation algorithm for the concentrator location problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1995
1995
1996
1996

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…A number of publications describe successful parallelization of algorithms at the Institute of Cybernetics for large optimization problems. Thus, computational experiments solving a 0-1 programming concentrator location problem in a hierarchical network (a "connection machine") were run with up to 2048 parallel processors [173]. The problem was solved by the previously mentioned subgradient method with space stretching in the direction of the difference of two successive gradients [41].…”
Section: Development Of Multiprocessor Computers and Softwarementioning
confidence: 99%
“…A number of publications describe successful parallelization of algorithms at the Institute of Cybernetics for large optimization problems. Thus, computational experiments solving a 0-1 programming concentrator location problem in a hierarchical network (a "connection machine") were run with up to 2048 parallel processors [173]. The problem was solved by the previously mentioned subgradient method with space stretching in the direction of the difference of two successive gradients [41].…”
Section: Development Of Multiprocessor Computers and Softwarementioning
confidence: 99%