Automatic synthesis of parallel algorithms

Megson, Graham M.; Rapanotti, Lucia and Chen, Xu (1995). Automatic synthesis of parallel algorithms. In: Ferreira, A. and Pardalos, P.M. eds. Solving Combinatorial Optimization Problems in Parallel. Lecture Notes in Computer Science (1054). Berlin: Springer-Verlag, pp. 51–86.

DOI: https://doi.org/10.1007/BFb0027114

URL: http://www.springer.com/computer/foundations/book/...

Abstract

Solving combinatorial optimization problems can often lead to runtime growing exponentially as a function of the input size. But important real-world problems, industrial applications, and academic research challenges, may demand exact optimal solutions. In such situations, parallel processing can reduce the runtime from days or months, typical when one workstation is used, to a few minutes or even seconds.
Partners of the CEC-sponsored SCOOP Project (Solving Combinatorial Optimization Problems in Parallel) contributed, on invitation, to this book; much attention was paid to competent coverage of the topic and the style of writing. Readers will include students, scientists, engineers, and professionals interested in the design and implementation of parallel algorithms for solving combinatorial optimization problems.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI