Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
DIB—a distributed implementation of backtracking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Principles of artificial intelligence
Principles of artificial intelligence
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Communications of the ACM
Parallel depth first search. Part I. implementation
International Journal of Parallel Programming
Parallel depth first search. Part II. analysis
International Journal of Parallel Programming
A general branch-and-bound formulation for and/or graph and game tree search
Search in Artificial Intelligence
The connection machine
Scans as Primitive Parallel Operations
IEEE Transactions on Computers
A dynamic scheduling strategy for the Chare-Kernel system
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Hypercube algorithms: with applications to image processing and pattern recognition
Hypercube algorithms: with applications to image processing and pattern recognition
Optimal speedup for backtrack search on a butterfly network
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Computing biconnected on a hypercube
The Journal of Supercomputing
Scalability of parallel algorithms for the all-pairs shortest-path problem
Journal of Parallel and Distributed Computing
Unstructured tree search on SIMD parallel computers: a summary of results
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
A SIMD approach to parallel heuristic search
Artificial Intelligence
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Scalable load balancing techniques for parallel computers
Journal of Parallel and Distributed Computing
Analyzing scalability of parallel algorithms and architectures
Journal of Parallel and Distributed Computing - Special issue on scalability of parallel algorithms and architectures
Uncertainty in Artificial Intelligence
Uncertainty in Artificial Intelligence
Fundamentals of Computer Alori
Fundamentals of Computer Alori
On the Efficiency of Parallel Backtracking
IEEE Transactions on Parallel and Distributed Systems
The Scalability of FFT on Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Parallel Processing of Combinatorial Search
Proceedings of the International Workshop on Parallel Algorithms and Architectures
A Parallel Algorithm for Graph Matching and Its MasPar Implementation
IEEE Transactions on Parallel and Distributed Systems
Parallel Formulations of Decision-Tree Classification Algorithms
Data Mining and Knowledge Discovery
State of the Art in Parallel Search Techniques for Discrete Optimization Problems
IEEE Transactions on Knowledge and Data Engineering
On multiprocessor task scheduling using efficient state space search approaches
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We present new methods for load balancing of unstructured tree computations onlarge-scale SIMD machines, and analyze the scalability of these and other existingschemes. An efficient formulation of tree search on an SIMD machine consists of twomajor components: a triggering mechanism, which determines when the search spaceredistribution must occur to balance the search space over processors, and a scheme toredistribute the search space. We have devised a new redistribution mechanism and anew triggering mechanism. Either of these can be used in conjunction with triggering andredistribution mechanisms developed by other researchers. We analyze the scalability ofthese mechanisms and verify the results experimentally. The analysis and experimentsshow that our new load-balancing methods are highly scalable on SIMD architectures.Their scalability is shown to he no worse than that of the best load-balancing schemeson MIMD architectures. We verify our theoretical results by implementing the 15-puzzleproblem on a CM-2 SIMD parallel computer.