The buffered work-pool approach for search-tree based optimization algorithms

  • Authors:

  • Faisal N. Abu-Khzam;Mohamad A. Rizk;Deema A. Abdallah;Nagiza F. Samatova

  • Affiliations:

  • Division of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon;Division of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon;Division of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon;Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN and Computer Science Department, North Carolina State University, Raleigh, NC

  • Venue:
  • PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent advances in algorithm design have shown a growing interest in seeking exact solutions to many hard problems. This new trend has been motivated by hardness of approximation results that appeared in the last decade, and has taken a great boost by the emergence of parameterized complexity theory. Exact algorithms often follow the classical search-tree based recursive backtracking strategy. Different algorithms adopt different branching and pruning techniques in order to reduce the unavoidable exponential growth in run time. This paper is concerned with another time-saving approach by developing new methods for exploiting high-performance computational platforms. A load balancing strategy is presented that could exploit multi-core architectures, such as clusters of symmetric multiprocessors. The well-known Maximum Clique problem is used as an exemplar to illustrate the utility of our approach.