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.

URL: http://www.springer.com/computer/foundations/book/...
DOI (Digital Object Identifier) Link: http://dx.doi.org/10.1007/BFb0027114
Google Scholar: Look up in Google Scholar

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.

Item Type: Book Chapter
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/Department: Mathematics, Computing and Technology > Computing & Communications
Interdisciplinary Research Centre: Centre for Research in Computing (CRC)
Item ID: 19126
Depositing User: Lucia Rapanotti
Date Deposited: 04 Dec 2009 10:57
Last Modified: 02 Dec 2010 20:42
URI: http://oro.open.ac.uk/id/eprint/19126
Share this page:

Altmetrics

Scopus Citations

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk