Parallel and Distributed Branch-and-Bound/A* Algorithms (1994)
BibTeX
@MISC{Cung94paralleland,
author = {V.-D. Cung and S. Dowaji and B. Le Cun and T. Mautor and C. Roucairol},
title = {Parallel and Distributed Branch-and-Bound/A* Algorithms},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this report, we propose new concurrent data structures and load balancing strategies for Branch-and-Bound (B&B)/A* algorithms in two models of parallel programming : shared and distributed memory. For the shared memory model (SMM), we present a general methodology which allows concurrent manipulations for most tree data structures, and show its usefulness for implementation on multiprocessors with global shared memory. Some priority queues which are suited for basic operations performed by B&B algorithms are described : the Skew-heaps, the funnels and the Splay-trees. We also detail a specific data structure, called treap and designed for A* algorithm. These data structures are implemented on a parallel machine with shared memory : KSR1. For the distributed memory model (DMM), we show that the use of partial cost in the B&B algorithms is not enough to balance nodes between the local queues. Thus, we introduce another notion of priority, called potentiality, between nodes that take...
