Name
Abstract | ||
|---|---|---|
this paper, we present effective mapping and load-balancing functions thatyield nearly linear performance on large systems, when the inherent parallelism ofthe given optimization problem is large enough. After giving an overview of techniquesfor dynamically mapping tree structured computations onto parallel computerarchitectures, we will present detailed results of some techniques found to be veryefficient even on large scale parallel computing systems. Results will be presented for* This ... |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/BFb0027120 | Solving Combinatorial Optimization Problems in Parallel |
Keywords | Field | DocType |
parallel computer,tree-structured combinatorial optimization problem,tree structure,load balance,optimization problem | Computational problem,Global optimization,Quadratic assignment problem,Steiner tree problem,Computer science,Theoretical computer science,Combinatorial optimization,Assignment problem,Optimization problem,Metaheuristic | Conference |
ISBN | Citations | PageRank |
3-540-61043-X | 4 | 0.49 |
References | Authors | |
30 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Reinhard Lüling | 1 | 313 | 35.55 |
| Burkhard Monien | 2 | 2199 | 279.35 |
| Alexander Reinefeld | 3 | 889 | 126.08 |
| Stefan Tschöke | 4 | 60 | 6.05 |