Abstract
In this work, we study on distributed memory architecture, the parallelization of the continuous global optimization problem, based on interval arithmetic, with inequality constraints. Since this algorithm is dynamic and irregular, we propose, in particular, some techniques taking into account the load balancing problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benyoub A., Daoudi E.M.: An Algorithm for Finding an Approximate Feasible Point by Using Interval Arithmetic, LaRI Laboratory, Dept. Maths&CS. Faculty for Science, Univ. Mohammed First, Oujda, Morocco, 2000.
Berner S.: A Parallel Method for Verified Global Optimization, Scientific Computing and Validated Numerics: Proc. Int. Sym. on Sc. Computing; G. Alefeld, A. Frommer, B. Lang editors, Akademie Verlag GmbH, Berlin, Germany, 1996.
Casado L.G., Garcia I.: Work Load Balance approaches for Branch-and-Bound Algorithms on Distributed Systems, Department of Computer Architecture and Electronics, Almeria University, Almeria, Spain.
Denneulin Y., Mehaut J.F., Planquelle B., Revol N.: Parallelization of Continuous Verified Global Optimization, Presented at the 19th Conference TC7 on System Modeling and Optimization, Cambridge, United Kingdom, July 1999.
Eriksson J., Lindstöm P.: A Parallel Interval Method Implementation for Global Optimization using Dynamic Load Balancing, Reliable Computing, 1, 1995, 77–91.
Hansen E.: Global Optimization Using Interval Analysis, Marcel Decker, NewYork, USA, 1992.
Leclerc A.P.: Efficient and Reliable Global Optimization, PhD Thesis, The Ohio State University, USA, 1992.
Leclerc A.P.: Parallel Interval Global Optimization and its Implementation in C++, Interval Computations, 3, 1993, 148–163.
Messine F.: Méthodes d’Optimisation Globale basées sur l’Analyse d’Intervalle pour la Résolution de Problèmes avec Contraintes, Thèse, Université Paul Sabatier, IRIT-Toulouse, France, Septembre, 1997.
Ratschek H., Rokne J.:New Computer Methods for Global Optimization, Ellis Horwood Limited, Market Cooper Street, Chichester, West Sussex, PO19 1EB, England, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benyoub, A., Daoudi, E.M. (2001). Parallelization of the Continuous Global Optimization Problem with Inequality Constraints by Using Interval Arithmetic⋆. In: Hertzberger, B., Hoekstra, A., Williams, R. (eds) High-Performance Computing and Networking. HPCN-Europe 2001. Lecture Notes in Computer Science, vol 2110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48228-8_68
Download citation
DOI: https://doi.org/10.1007/3-540-48228-8_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42293-8
Online ISBN: 978-3-540-48228-4
eBook Packages: Springer Book Archive