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...
Saved in:
| Main Author: | Abu-Khzam, F.N. (author) |
|---|---|
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | 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/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A decentralized load balancing strategy for parallel search-three optimization. (c2010)
by: Mouawad, Amer E.
Published: (2010) -
Highly scalable parallel search-tree algorithms
by: Abu-Khzam, Faisal N.
Published: (2017) -
The buffered work-pool approach for search-tree based optimization algorithms
by: Abu-Khzam, Faisal N.
Published: (2017) -
An evolutionary approach to load balancing parallel computations
by: Mansour, Nashat
Published: (1991) -
A bounded search tree algorithm for parameterized
by: Abu-Khzam, Faisal N.
Published: (2008)