A New Parallel Schema for Branch-and-Bound Algorithms Using GPGPU

This work presents a new parallel procedure designed to process combinatorial B&B algorithms using GPGPU. In our schema we dispatch a number of threads that treats intelligently the massively parallel processors of NVIDIA GeForce graphical units. The strategy is to build sequentially a series of initial searches that can map a subspace of the B&B tree by starting a number of limited threads after achieving a specific level of the tree. The search is then processed massively by DFS. The whole subspace is optimized accordingly to memory and limits of threads and blocks available by the GPU. We compare our results with its OpenMP and Serial versions of the same search schema using explicitly enumeration (all possible solutions) to the Asymmetrical Travelling Salesman Problem's instances. We also show the great superiority of our GPGPU based method.

[1]  Tiago Carneiro Pessoa,et al.  JUREMA , A NEW BRANCH & BOUND ANYTIME ALGORITHM FOR THE ASYMMETRIC TRAVELLING SALESMAN PROBLEM , 2010 .

[2]  Weixiong Zhang.  Branch-and-Bound Search Algorithms and Their Computational Complexity. , 1996 .

[3]  Bernard Gendron,et al.  Parallel Branch-and-Branch Algorithms: Survey and Synthesis , 1994, Oper. Res..

[4]  Samuel Williams,et al.  The Landscape of Parallel Computing Research: A View from Berkeley , 2006 .

[5]  John Shalf,et al.  The new landscape of parallel computer architecture , 2007 .

[6]  Keld Helsgaun,et al.  An Effective Implementation of K-opt Moves for the Lin-Kernighan TSP Heuristic , 2007 .

[7]  Jie Cheng,et al.  CUDA by Example: An Introduction to General-Purpose GPU Programming , 2010, Scalable Comput. Pract. Exp..

[8]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[9]  Jeannette M. Wing.  An introduction to computer science for non-majors using principles of computation , 2007, SIGCSE.

[10]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[11]  Weixiong Zhang,et al.  Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem , 2011, J. Artif. Intell. Res..

[12]  Teodor Gabriel Crainic,et al.  Parallel Branch‐and‐Bound Algorithms , 2006 .

[13]  Kunle Olukotun,et al.  The Future of Microprocessors , 2005, ACM Queue.

[14]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[15]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[16]  Weixiong Zhang,et al.  A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem , 1996, Artif. Intell..

[17]  Kurt Keutzer,et al.  The Concurrency Challenge , 2008, IEEE Design & Test of Computers.

[18]  Christopher Dyken,et al.  State-of-the-art in heterogeneous computing , 2010, Sci. Program..

[19]  Weixiong Zhang,et al.  Depth-First Branch-and-Bound versus Local Search: A Case Study , 2000, AAAI/IAAI.

[20]  Teodor Gabriel Crainic,et al.  PARALLEL BRANCH-AND-BOUND ALGORITHMS: SURVEY AND SYNTHESIS , 1993 .

[21]  Pradeep Dubey,et al.  Debunking the 100X GPU vs. CPU myth: an evaluation of throughput computing on CPU and GPU , 2010, ISCA.

[22]  James R. Larus,et al.  Software and the Concurrency Revolution , 2005, ACM Queue.

[23]  David S. Johnson,et al.  Experimental Analysis of Heuristics for the STSP , 2007 .

[24]  Donald L. Miller,et al.  Exact Solution of Large Asymmetric Traveling Salesman Problems , 1991, Science.

[25]  Jie Cheng,et al.  Programming Massively Parallel Processors. A Hands-on Approach , 2010, Scalable Comput. Pract. Exp..

[26]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[27]  Jens Clausen,et al.  On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search , 1999, Ann. Oper. Res..

[28]  John D. McCalpin,et al.  The Role of Multicore Processors in the Evolution of General-Purpose Computing , 2009 .

[29]  T. U. Van Le,et al.  Techniques of Prolog Programming with Implementation of Logical Negation and Quantified Goals , 1992 .

[30]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[31]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).