On parallel Branch and Bound frameworks for Global Optimization
| العنوان: | On parallel Branch and Bound frameworks for Global Optimization |
|---|---|
| المؤلفون: | Eligius M. T. Hendrix, Leocadio G. Casado, José Manuel Salmerón, Juan Rodriguez Herrera, Rafael Asenjo |
| المصدر: | Journal of Global Optimization 69 (2017) 3 Herrera, J F R, Salmerón, J M G, Hendrix, E M T, Asenjo, R & Casado, L G 2017, ' On parallel Branch and Bound frameworks for Global Optimization ', Journal of Global Optimization, vol. 69, no. 3, pp. 547-560 . https://doi.org/10.1007/s10898-017-0508-y Journal of Global Optimization, 69(3), 547-560 |
| بيانات النشر: | Springer Science and Business Media LLC, 2017. |
| سنة النشر: | 2017 |
| مصطلحات موضوعية: | Control and Optimization, Theoretical computer science, Computer science, Framework, 0211 other engineering and technologies, WASS, 010103 numerical & computational mathematics, 02 engineering and technology, Management Science and Operations Research, 01 natural sciences, TBB, Operationele Research en Logistiek, Shared-memory, 0101 mathematics, Global optimization, Implementation, POSIX Threads, 021103 operations research, Branch and bound, Applied Mathematics, Branch-and-Bound, Load balancing (computing), Search tree, Computer Science Applications, Shared memory, Scalability, Operations Research and Logistics, Load balancing |
| الوصف: | Branch and Bound (B&B) algorithms are known to exhibit an irregularity of the search tree. Therefore, developing a parallel approach for this kind of algorithms is a challenge. The efficiency of a B&B algorithm depends on the chosen Branching, Bounding, Selection, Rejection, and Termination rules. The question we investigate is how the chosen platform consisting of programming language, used libraries, or skeletons influences programming effort and algorithm performance. Selection rule and data management structures are usually hidden to programmers for frameworks with a high level of abstraction, as well as the load balancing strategy, when the algorithm is run in parallel. We investigate the question by implementing a multidimensional Global Optimization B&B algorithm with the help of three frameworks with a different level of abstraction (from more to less): Bobpp, Threading Building Blocks (TBB), and a customized Pthread implementation. The following has been found. The Bobpp implementation is easy to code, but exhibits the poorest scalability. On the contrast, the TBB and Pthread implementations scale almost linearly on the used platform. The TBB approach shows a slightly better productivity. |
| وصف الملف: | application/pdf; application/octet-stream |
| تدمد: | 1573-2916 0925-5001 |
| DOI: | 10.1007/s10898-017-0508-y |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97b887b3c37c517121d88417cb92e238 https://doi.org/10.1007/s10898-017-0508-y |
| Rights: | OPEN |
| رقم الانضمام: | edsair.doi.dedup.....97b887b3c37c517121d88417cb92e238 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 15732916 09255001 |
|---|---|
| DOI: | 10.1007/s10898-017-0508-y |