Branch-and-Bound interval global optimization on shared memory multiprocessors

Optimization Methods and Software

Volumn 23, Issue 5, 2008, Pages 689-701

  Casado, L G ^a   Martinez J A ^a   Garcia I ^a   Hendrix, E M T ^b  

^a UNIVERSITY OF ALMERÍA   (Spain)

^b UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Branch and Bound; Global optimization; Interval arithmetic; Multithreading; Parallel algorithms; Shared memory

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING; COMPUTER SCIENCE; COMPUTER SYSTEMS; EXPERIMENTS; MATHEMATICAL PROGRAMMING; NUMERICAL ANALYSIS; OPTIMIZATION; PARALLEL ALGORITHMS; PERSONAL COMPUTERS; STANDARDS;

ANALYSIS AND EVALUATION; BRANCH-AND-BOUND; INTERVAL ANALYSIS; INTERVAL ARITHMETIC; INTERVAL GLOBAL OPTIMIZATION; LOCAL MEMORIES; MULTI-CORE PROCESSORS; MULTITHREADING; ON CURRENTS; PARALLEL STRATEGIES; PRAGUE , CZECH REPUBLIC; PROCESS UNITS; PROGRAMMING MODELS; SHARED MEMORIES; SHARED MEMORY; SHARED-MEMORY MULTIPROCESSORS; SPEED UPS; STANDARD SYSTEMS; TARGET COMPUTERS;

GLOBAL OPTIMIZATION;

EID: 52149104471     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780802086300     Document Type: Conference Paper

References (36)

1. D. A. Bader, W.E. Hart, and C.A. Phillips, Parallel algorithm design for branch and bound, in Tutorials on Emerging Methodologies and Applications in Operations Research, H. Greenberg, ed., Chapter 5, Springer, New York, 2004, pp. 1-44.
2. A. Benyoub and E.M. Daoudi, Parallelization of the continuous global optimization problem with inequality constraints by using interval arithmetic, in High-Performance Computing and Networking, Lecture Notes in Computer Science, Vol. 2110, Springer, Berlin, 2001, pp. 595-599.
3. E.D. Berger et al., Hoard: a scalable, memory allocator for multithreaded applications, SIGPLAN Not. 35 (2000), pp. 117-128.
4. S. Berner, Parallel methods for verified global optimization, practice and theory, J. Global Optim. 9 (1996), pp. 1-22.
5. O. Caprani, B. Godthaab, and K. Madsen, Use. of a real-valued local minimum in parallel interval global optimization, Inter. Comput. 2 (1993), pp. 71-82.
6. O. Caprani and K. Madsen, An almost embarrasingly parallel interval global optimization method, in Interval '98, Nanjing University, 1998, pp. 15-18.
7. L.G. Casado and I. Garcia, Work load balance approaches for branch and bound algorithms on distributed systems, in Proceedings of the 7th Euromicro Workshop on Parallel and Distributed Processing, IEEE Press, Danvers, MA, 1999, pp. 155-162.
8. J. Clausen, Parallel search-based methods in optimization, in Applied Parallel Computing Industrial Computation and Optimization, Lecture Notes in Computer Science, Vol. 1184, Springer, Berlin, 1996, pp. 176-185.
9. R. Correa and A. Ferreira, Parallel best-first branch and bound in discrete optimization: aframework, in IRREGULAR '95, Solving Combinatorial Optimization Problems in Parallel Methods and Techniques, R. Correa and P. Pardalos, eds, Springer, Berlin, 1996, pp. 145-170.
10. T. Crainic, B.L. Cun, and C. Roucairol, Parallel branch and bound algorithms, in Parallel Combinatorial Optimization, E.G. Talbi, ed., Chapter 1, John. Wiley & Sons, New Jersey, 2006, pp. 1-28.
11. L. Dixon and G. Szego, Towards Global Optimization, 1, North-Holland, Amsterdam, 1975.
12. I. Dorta, C. Leon, and C. Rodríguez, Performance analysis of branch-and-bound skeletons, in Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP '06), IEEE computer Society, Danvers, MA, 2006, pp. 75-82.
13. J. Eriksson and P. Lindstrom, A parallel interval method implementation for global optimization using dynamic load balancing, Reliab. Comput. 1 (1995), pp. 77-91.
14. B. Gendron and T.G. Crainic, Parallel branch-and-bound algorithms: Survey and synthesis, Oper. Res. 42 (1994), pp. 1042-1066.
15. E. Hansen and G.W. Walster, Global Optimization Using Interval Analysis, Pure and Applied Mathematics, CRC Press, Baca Raton, FL, 2003.
16. T. Henriksen and K. Madsen, Parallel algorithms for Global Optimization, Inter. Comput. 3 (1992), pp. 88-95.
17. _, Use of a depth-first strategy in parallel Global Optimization, Tech. Rep. 92-10, Institute for Numerical Analysis, Technical University of Denmark, 1992.
18. S. Ibraev, A new parallel method for verified global optimization, Ph.D. thesis, University of Wuppertal, Wuppertal, 2001.
19. S. Kahan andP. Konecny, MAMA!': a memory allocator for multithreaded architectures, in PPoPP '06: Proceedings of the eleventh ACM SIGPLAN symposium on, Principles and practice of parallel programming, ACM Press, New York, 2006, pp. 178-186.
20. R.B. Kearfott, Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht, Holland, 1996.
21. K. Knizhnik, Threadalloc. Available at http://www.garret.ru/ knizhnik/threadalloc, 2006.
22. A. Leclerc, Parallel interval global optimization and its implementation in C++, Inter. Comput. 3 (1993), pp. 148-163.
23. J. Martínez et al., Interval parallel global optimization with Charm++, Lecture Notes Comput. Sci. 3732 (2006), pp. 161-168.
24. J.A. Martinez et al., AMIGO: Advanced multidimensional interval analysis global optimization algorithm, in Nonconvex Optimization and Applications Series. Frontiers in Global Optimization, C. Floudas and P. Pardalos, eds., Vol. 74, Kluwer Academic Publishers, 2004, pp. 313-326.
25. R. Moore, Interval Analysis, Prentice-Hall, New Jersey, USA, 1966.
26. R. Moore, E. Hansen, and A. Leclerc, Rigorous methods for global optimization, in Recent Advances in Global Optimization, C.A. Floudas and P.M. Pardalos, eds., Princeton series in computer science, Princeton. University Press, Princeton, NJ, USA, 1992, pp. 321-342.
27. A. Neumaier, Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990.
28. B. Nichols, D. Buttlar, and J.P. Farrell, PThreads Programming: A POSIX Standard for Better Multiprocessing, O'Reilly, Sebastopol, CA, 1998.
29. P.M. Pardalos, G. Xue, and P.D. Panagiotopoulos, Parallel algorithms for global optimization problems, in Solving Combinatorial Optimization Problems in Parallel - Methods and Techniques, Springer-Verlag, Berlin, 1996, pp. 232-247.
30. H. Ratschek and J. Rokne, New Computer Methods for Global Optimization, Ellis Horwood Ltd., Chichester, England, 1988.
31. D. Ratz and T. Csendes, On the selection of subdivision directions in interval branch and bound methods for global optimization, J. Global Optim. 7 (1995), pp. 183-207.
32. N. Revol et al., A methodology of parallelization for continuous verified global optimization, in Parallel Processing and Applied Mathematics: 4th International Conference, PPAM 2001, Lecture Notes in Computer Science, Vol. 2328, Springer, Berlin, 2002, pp. 803-810.
33. A.A. Torn and A. Zilinskas, Global Optimization, Lecture Notes in Computer Science, Vol. 350, Springer, Berlin, 1989.
34. G.W. Walster, E.R. Hansen, and S. Sengupta, Test results for a global optimization algorithm, in Numerical Optimization 1984, P.T. Boggs, R.H. Byrd, and R.B. Schnabel, eds, SIAM, Philadelphia, 1985, pp. 272-287.
35. A. Wiethoff, Verifizierte globale Optimierung auf parallelrechnern, Ph.D. thesis, Universitt Karlsruhe, Karlsruhe, 1998.
36. F. Zabatta and K. Ying, Dynamic thread creation: An asynchronous load balancing scheme for parallel searches, in Proceedings of 10th International Conference on Parallel and Distributed Computing and Systems, IASTED ACTA Press, Anahem, CA, 1998.