Anomalies in parallel branch-and-bound algorithms

Authors:
Ten-Hwang Lai;Sartaj Sahni
Affiliations:
Ohio State Univ., Columbus;Univ. of Minnesota, Minneapolis
Venue:
Communications of the ACM
Year:
1984

Citing 3
Cited 48

MANIP-a parallel computer system for implementing branch and bound algorithms

ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Hierarchical multiprocessor organizations

ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence

Coping with anomalies in parallel branch-and-bound algorithms

IEEE Transactions on Computers - The MIT Press scientific computation series
Survey on special purpose computer architectures for AI

ACM SIGART Bulletin
DIB—a distributed implementation of backtracking

ACM Transactions on Programming Languages and Systems (TOPLAS)
Process and workload migration for a parallel branch-and-bound algorithm on a hypercube multicomputer

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
DASP: a general-purpose MIMD parallel computer using distributed associative processing

Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Analysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer

IEEE Transactions on Computers
Computational Efficiency of Parallel Combinatorial OR-Tree Searches

IEEE Transactions on Software Engineering
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems

CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
An exact parallel algorithm for the resource constrained traveling salesman problem with application to scheduling with an aggregate deadline

CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
A parallel branch-and-bound algorithm for MIN-based multiprocessors

SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Performance debugging using parallel performance predicates

PADD '93 Proceedings of the 1993 ACM/ONR workshop on Parallel and distributed debugging
Search in concurrent logic languages

SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
A parallel search chess program

ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
A parallel best-first search

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Nagging: a scalable fault-tolerant paradigm for distributed search

Artificial Intelligence
Performance Metrics: Keeping the Focus on Runtime

IEEE Parallel & Distributed Technology: Systems & Technology
Programming a Hypercube Multicomputer

IEEE Software
Storage Management in Virtual Tree Machines

IEEE Transactions on Computers
State of the Art in Parallel Search Techniques for Discrete Optimization Problems

IEEE Transactions on Knowledge and Data Engineering
Modeling Speedup (n) Greater than n

IEEE Transactions on Parallel and Distributed Systems
VMMP: A Practical Tool for the Development of Portable and Efficient Programs for Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
On the Efficiency of Parallel Backtracking

IEEE Transactions on Parallel and Distributed Systems
Evaluation of a Parallel Branch-and-Bound Algorithm on a Class of Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Knapsack on VLSI: from Algorithm to Optimal Circuit

IEEE Transactions on Parallel and Distributed Systems
Heterogeneous computing and parallel genetic algorithms

Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
Mobile Agents for Distributed and Dynamically Balanced Optimization Applications

HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
On the Evaluation of the Distributed Objects and Mobile Agents Programming Models for a Distributed Optimization Application

PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Parallelization of the scatter search for the p-median problem

Parallel Computing - Special issue: Parallel computing in logistics
Solving the Maximum Clique Problem using PUBB

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Superlinear Performance in Real-Time Parallel Computation

The Journal of Supercomputing
PODC: Paradigm-oriented distributed computing

Journal of Parallel and Distributed Computing
A hierarchical distributed-shared memory parallel Branch&Bound application with PVM and OpenMP for multiprocessor clusters

Parallel Computing - OpenMp
On multiprocessor task scheduling using efficient state space search approaches

Journal of Parallel and Distributed Computing
Stack splitting: a technique for efficient exploitation of search parallelism on share-nothing platforms

Journal of Parallel and Distributed Computing
A grid-enabled distributed branch-and-bound algorithm with application on the Steiner problem in graphs

Parallel Computing - Optimization on grids - Optimization for grids
The Performance of a Parallel TSP Program and Byte Sequential Benchmarks Executing on a Shared Cluster

International Journal of High Performance Computing Applications
COHESION - A microkernel based Desktop Grid platform for irregular task-parallel applications

Future Generation Computer Systems
Parallel computing on clusters and enterprise grids: practice and experience

International Journal of High Performance Computing and Networking
Parallel iterative A* search: an admissible distributed heuristic search algorithm

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Paper: Automatic test pattern generation on parallel processors

Parallel Computing
Agent-oriented programming: from prolog to guarded definite clauses

Agent-oriented programming: from prolog to guarded definite clauses
Consistent linear speedups to a first solution in parallel state-space search

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Execution environments and benchmarks for the study of applications’ scheduling on clusters

ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Parallel search for Ramsey grid colorings

Proceedings of the 50th Annual Southeast Regional Conference
Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem

Operations Research Letters
Branch-and-bound and parallel computation: A historical note

Operations Research Letters
Partitioning Search Spaces of a Randomized Search

Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Grid branch-and-bound for permutation flowshop

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II

Quantified Score

Hi-index	48.22

Visualization

Abstract

We consider the effects of parallelizing branch-and-bound algorithms by expanding several live nodes simultaneously. It is shown that it is quite possible for a parallel branch-and-bound algorithm using n2 processors to take more time than one using n1 processors, even though n1 n2. Furthermore, it is also possible to achieve speed-ups that are in excess of the ratio n2/n1. Experimental results with the 0/1-Knapsack and Traveling Salesman problems are also presented.