Experiments with parallel algorithms for combinatorial problems

European Journal of Operational Research

Volumn 33, Issue 1, 1988, Pages 65-81

  Kindervater, G A P ^a   Trienekens, H W J M ^b  

^a CWI   (Netherlands)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

branch and bound; change making; dataflow; divide and conquer; dynamic programming; knapsack; MIMD; Parallel computer; pipelining; shortest paths; SIMD

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL PROGRAMMING, DYNAMIC;

COMBINATORIAL PROBLEMS; DATAFLOW; PARALLEL ALGORITHMS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0023825357     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(88)90255-X     Document Type: Article

References (16)

1. Data flow languages
2. FORTRAN 200 Version 1
3. Alice-A multi-processor reduction machine for the parallel evaluation of applicative languages
4. A note on two problems in connexion with graphs
5. Algorithm 97 Shortest Path
6. Very high-speed computing systems
7. The Manchester prototype dataflow computer
8. DAP: Fortran Language
9. DAP: Developing DAP Programs
10. Sisal: Streams and Iteration in a Single Assignment Language
11. Data-driven and demand-driven computer architecture
12. A theorem on Boolean matrices
13. The dataflow approach—Architecture and performance