A decentralized load balancing approach for parallel search-tree optimization
Current generation supercomputers have over one million cores awaiting highly demanding computations and applications. An area that could largely benefit from such processing capabilities is naturally that of exact algorithms for NP-hard problems. We propose a general implementation framework that t...
محفوظ في:
| المؤلف الرئيسي: | Abu-Khzam, F.N. (author) |
|---|---|
| التنسيق: | conferenceObject |
| منشور في: |
2017
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/5382 http://dx.doi.org/10.1109/PDCAT.2012.16 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://ieeexplore.ieee.org/abstract/document/6589259/ |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
A decentralized load balancing strategy for parallel search-three optimization. (c2010)
حسب: Mouawad, Amer E.
منشور في: (2010) -
Highly scalable parallel search-tree algorithms
حسب: Abu-Khzam, Faisal N.
منشور في: (2017) -
The buffered work-pool approach for search-tree based optimization algorithms
حسب: Abu-Khzam, Faisal N.
منشور في: (2017) -
An evolutionary approach to load balancing parallel computations
حسب: Mansour, Nashat
منشور في: (1991) -
A bounded search tree algorithm for parameterized
حسب: Abu-Khzam, Faisal N.
منشور في: (2008)