The Open UniversitySkip to content

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 (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


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.

Item Type: Book Section
Copyright Holders: 1996 Springer Verlag
ISBN: 3-540-61043-X, 978-3-540-61043-4
Keywords: combinatorial optimisation; integer programming; mathematical programming; parallel algorithms; parallel approximation
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Research Group: Centre for Research in Computing (CRC)
Item ID: 19126
Depositing User: Lucia Rapanotti
Date Deposited: 04 Dec 2009 10:57
Last Modified: 07 Dec 2018 09:29
Share this page:


Altmetrics from Altmetric

Citations from Dimensions

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU