An easy-to-use scalable framework for parallel recursive backtracking
Supercomputers are equipped with an increasingly large number of cores to use computational power as a way of solving problems that are otherwise intractable. Unfortunately, getting serial algorithms to run in parallel to take advantage of these computational resources remains a challenge for severa...
Saved in:
| Main Author: | Abu-Khzam, Faisal N. (author) |
|---|---|
| Other Authors: | Daudjee, Khuzaima (author), Mouawad, Amer E. (author), Nishimura, Naomi (author) |
| Format: | article |
| Published: |
2013
|
| Online Access: | http://hdl.handle.net/10725/7594 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://arxiv.org/abs/1312.7626 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On scalable parallel recursive backtracking
by: Abu-Khzam, Faisal N.
Published: (2015) -
A hybrid graph representation for recursive backtracking algorithms
by: Abu-Khzam, Faisal N.
Published: (2017) -
Scalable Parallel Algorithms for FPT Problems
by: Abu-Khzam, Faisal N.
Published: (2006) -
Highly scalable parallel search-tree algorithms
by: Abu-Khzam, Faisal N.
Published: (2017) -
Scalable parallel algorithms for difficult combinatorial problems
by: Abu-Khzam, Faisal N.
Published: (2004)