A methodology of parallelization for continuous verified global optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

A methodology of parallelization for continuous verified global optimization

Abstract

Hansen's algorithm for verified continuous global optimization is based on interval arithmetic. It is of the Branch&Bound type. Our proposal for the parallelization of Hansen's algorithm consists in creating a lightweight process or thread to explore each subinterval and in beginning its execution immediately after its creation. This strategy provides a high level of speculation and enables to virtualize the architecture. The implementation of this parallel algorithm is based on the parallel execution support PM2 for the handling of threads at a low cost and on the PROFIL/BIAS interval library. Preliminary experimental results exhibit superlinear speed-ups.

Dates and versions

inria-00545078 , version 1 (09-12-2010)

Identifiers

Cite

Nathalie Revol, Yves Denneulin, Jean-François Méhaut, Benoît Planquelle. A methodology of parallelization for continuous verified global optimization. PPAM 2001: Parallel Processing and Applied Mathematics, Roman Wyrzykowski, Sep 2001, Naleczow, Poland. pp.803-810, ⟨10.1007/3-540-48086-2_90⟩. ⟨inria-00545078⟩
167 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More