Skip to main content
SpringerLink
Log in

Parallel optimisation in the SCOOP library

  • Workshop on Solving Combinatorial Optimization Problems in Parallel Jena Clausen, Technical University of Denmark
  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1388))

Included in the following conference series:

Abstract

This paper shows how parallelism has been integrated into SCOOP, a C++ class library for solving optimisation problems. After a description of the modeling and the optimisation parts of SCOOP, two new classes that permit parallel optimisation are presented: a class whose only purpose is to handle messages and a class for managing optimiser and message handler objects. Two of the most interesting aspects of SCOOP, modularity and generality, are preserved by clearly separating problem representation, solution techniques and parallelisation scheme. This allows the user to easily model a problem and construct a parallel optimiser for solving it by combining existing SCOOP classes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. MPI Forum. MPI: A message-passing interface standard. International Journal of Supercomputer Applications, 8 (3/4):165–416, 1994.

    Google Scholar 

  2. SCOOP 2.0 Reference Manual, SINTEF report no. STF 42A98001, ISBN 82-1400047-5, 1998.

    Google Scholar 

  3. M. Benaichouche, V. D. Cung, S. Dowaji, B. Le Cun, T. Mautor and C. Roucairol. Building a Parallel Branch and Bound Library. Solving Combinatorial Optimization Problems in Parallel, LNCS 1054, Springer, 201–231, 1996.

    Google Scholar 

  4. R. Finkel and U. Manber. DIB-A Distributed Implementation of Backtracking. ACM Transaction on Programming Languages and Systems, 9(2):235–256, 1987.

    Article  Google Scholar 

  5. J.H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, 1975.

    Google Scholar 

  6. S. Kirkpatrick, C. Gellat and M. Vecchi. Optimisation by simulated annealing. Science, 220:671–680, 1983.

    Google Scholar 

  7. G. Misund, G. Hasle and B. S. Johansen. Solving the clear-cut scheduling problem with geographical information technology and constraint reasoning. In ScanGIS'95 Proceedings, pages 42–56, 1995. Also published as SINTEF report no. STF 33S95027.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SINTEF Applied Mathematics, Box 124 Blindern, 0314, Oslo, Norway

    Per Kristian Nilsen

  2. CERMICS-INRIA Sophia Antipolis, France

    Nicolas Prcovic

Authors
  1. Per Kristian Nilsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicolas Prcovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nilsen, P.K., Prcovic, N. (1998). Parallel optimisation in the SCOOP library. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_719

Download citation

  • DOI: https://doi.org/10.1007/3-540-64359-1_719

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64359-3

  • Online ISBN: 978-3-540-69756-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation