A scalable divide-and-conquer algorithm combining coarse and fine-grain parallelization
β Scribed by Sor Koon Goh; Carlos P. Sosa; Alain St-Amant
- Book ID
- 105887097
- Publisher
- Springer
- Year
- 1998
- Tongue
- English
- Weight
- 221 KB
- Volume
- 99
- Category
- Article
- ISSN
- 1432-2234
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The Keywords-parallel genetic algorithm, Parameter determination, naveling salesman problem. Parallel computer, Genetic operators. is applied successfully to problems in engineering, science, and other areas, and is able to find good solutions with reasonable amounts of computation time. However, wh
Bondeli, S\_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Computing 17 (1991) 419-434\_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel com