In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is admissible and give an informal analysis of its load balancing, scalability, and speedup. A flow-shop scheduling problem has been implemented on a BBN Butterfly Multicomputer using up to 80 processors to empirically test this algorithm. From our experiments, this algorithm is capable of achieving almost linear speedup on a large number of processors with a relatively small problem size.
Many of the articial intelligence techniques developed to date rely on heuristic search through larg...
Obtaining an optimal schedule for a set of precedence-constrained tasks with arbitrary costs is a we...
Scheduling and mapping of precedence-constrained task graphs to the processors is one of the most cr...
Abstract. This paper investigates an emerging class of search algorithms, in which high-level domain...
We discuss the implementation of heuristic search algorithms in a distributed problem solver whose p...
Abstract. Search in constraint programming is a time consuming task. Search can be speeded up by exp...
The increasing availability of “utility computing” resources such as clouds, grids, and massively pa...
Abstract. The matter of using scheduling algorithms in parallel com-puting environments is discussed...
Heuristic search is a fundamental technique for solving problems in artificial intelligence. However...
Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describe...
This paper describes HyPS, a hybrid parallel window / distributed tree search algorithm. Using this ...
International audienceTree-based search algorithms applied to combinatorial optimization problems ar...
The role of parallel processing in heuristic search is examined by means of an example (cryptarith...
The present paper discusses the implementation of the discrete search optimization techniques on a p...
This paper introduces a new scheduling algorithm for parallel single-agent search, transposition tab...
Many of the articial intelligence techniques developed to date rely on heuristic search through larg...
Obtaining an optimal schedule for a set of precedence-constrained tasks with arbitrary costs is a we...
Scheduling and mapping of precedence-constrained task graphs to the processors is one of the most cr...
Abstract. This paper investigates an emerging class of search algorithms, in which high-level domain...
We discuss the implementation of heuristic search algorithms in a distributed problem solver whose p...
Abstract. Search in constraint programming is a time consuming task. Search can be speeded up by exp...
The increasing availability of “utility computing” resources such as clouds, grids, and massively pa...
Abstract. The matter of using scheduling algorithms in parallel com-puting environments is discussed...
Heuristic search is a fundamental technique for solving problems in artificial intelligence. However...
Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describe...
This paper describes HyPS, a hybrid parallel window / distributed tree search algorithm. Using this ...
International audienceTree-based search algorithms applied to combinatorial optimization problems ar...
The role of parallel processing in heuristic search is examined by means of an example (cryptarith...
The present paper discusses the implementation of the discrete search optimization techniques on a p...
This paper introduces a new scheduling algorithm for parallel single-agent search, transposition tab...
Many of the articial intelligence techniques developed to date rely on heuristic search through larg...
Obtaining an optimal schedule for a set of precedence-constrained tasks with arbitrary costs is a we...
Scheduling and mapping of precedence-constrained task graphs to the processors is one of the most cr...