High performance Fortran: history, status and future
Parallel Computing - Special issues on languages and compilers for parallel computers
JOMP—an OpenMP-like interface for Java
Proceedings of the ACM 2000 conference on Java Grande
Anomalies in parallel branch-and-bound algorithms
Communications of the ACM
The PaCMAn metacomputer: parallel computing with Java mobile agents
Future Generation Computer Systems - Java in high-performance computing
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
OpenMP: An Industry-Standard API for Shared-Memory Programming
IEEE Computational Science & Engineering
Paradigms for the Parallelization of Branch and Bound Algorithms
PARA '95 Proceedings of the Second International Workshop on Applied Parallel Computing, Computations in Physics, Chemistry and Engineering Science
Resource management framework for collaborative computing systems over multiple virtual machines
Service Oriented Computing and Applications
| Hi-index | 0.01 |
Branch&Bound (B&B) is a technique widely used to solve combinatorial optimization problems in physics and engineering science. In this paper we show how the combined use of PVM and OpenMP libraries can be a promising approach to exploit the intrinsic parallel nature of this class of application and to obtain efficient code for hybrid computational architectures. We described how both the shared memory and the distributed memory programming models can be applied to implement the same algorithm for the inter-nodes and intra-node parallelization. Some experimental tests on a local area network (LAN) of workstations are finally discussed.