A parallel statistical cooling algorithm

  • E. H. L. Aarts
  • F. M. J. de Bont
  • J. H. A. Habers
  • P. J. M. van Laarhoven
Contributed Papers

DOI: 10.1007/3-540-16078-7_67

Part of the Lecture Notes in Computer Science book series (LNCS, volume 210)
Cite this paper as:
Aarts E.H.L., de Bont F.M.J., Habers J.H.A., van Laarhoven P.J.M. (1986) A parallel statistical cooling algorithm. In: Monien B., Vidal-Naquet G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg

Abstract

Statistical Cooling is a new optimization technique based on Monte-Carlo iterative improvement. Here we propose a parallel formulation of the statistical cooling algorithm based on the requirement that quasi-equilibrium is preserved throughout the optimization process. It is shown that the parallel algorithm can be executed in polynomial time. Performance of the algorithm is discussed by means of an implementation on an experimental multi-processor architecture. It is concluded that substantial reductions of computation time can be achieved by the parallel algorithm in comparison with the sequential algorithm.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • E. H. L. Aarts
    • 1
  • F. M. J. de Bont
    • 1
  • J. H. A. Habers
    • 1
  • P. J. M. van Laarhoven
    • 1
  1. 1.Philips Research LaboratoriesEindhoventhe Netherlands

Personalised recommendations