Add to ORKGThis paper presents a parallel implementation of the Iterative-Deepening A* algorithm on a parallel distributed memorymachine. Two kinds of dynamic load balancing strategies have been studied to overcome the irregular tree search problem. To study the effectiveness of the algorithm, it has been tested to solve a NP-complete problem: the fifteen puzzle. Our experimental results on a cluster of 16 ALPHA processors using PVM show that an efficiency of 97.54% for a speedup of 15.61 could be achieved on a hard problem
In this paper, we present a distributed computing framework for problems characterized by a highly i...
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is ...
International audienceThe most popular parallelization approach of the branch and bound algorithm co...
In parallel tree search environments, it is likely that some nodes are heavily loaded while others a...
Many algorithms in operations research and artificial intelligence are based on depth first search i...
Using two sample applications, we demonstrate the effectiveness of our portable and reusable library...
In this paper, we develop load balancing strategies for scalable high-performance parallel A* algori...
A recent trend in program methodologies is to derive efficient parallel programs from sequential pr...
Abstract—Current generation supercomputers have over one million cores awaiting highly demanding com...
Discovery of sequential patterns is becoming increasingly useful and essential in many scientific an...
. We present a new parallel tree search method for ønding one solution to a constraint satisfaction ...
Although efficient support for data-parallel applications is relatively well established, it remain...
AbstractThe paper considers efficient computational load distribution for the exact parallel algorit...
[[abstract]]To solve the load imbalance problem of a solution-adaptive finite element application pr...
[[abstract]]©2001 CIE-In this paper, we propose a binomial tree based parallel load-balancing method...
In this paper, we present a distributed computing framework for problems characterized by a highly i...
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is ...
International audienceThe most popular parallelization approach of the branch and bound algorithm co...
In parallel tree search environments, it is likely that some nodes are heavily loaded while others a...
Many algorithms in operations research and artificial intelligence are based on depth first search i...
Using two sample applications, we demonstrate the effectiveness of our portable and reusable library...
In this paper, we develop load balancing strategies for scalable high-performance parallel A* algori...
A recent trend in program methodologies is to derive efficient parallel programs from sequential pr...
Abstract—Current generation supercomputers have over one million cores awaiting highly demanding com...
Discovery of sequential patterns is becoming increasingly useful and essential in many scientific an...
. We present a new parallel tree search method for ønding one solution to a constraint satisfaction ...
Although efficient support for data-parallel applications is relatively well established, it remain...
AbstractThe paper considers efficient computational load distribution for the exact parallel algorit...
[[abstract]]To solve the load imbalance problem of a solution-adaptive finite element application pr...
[[abstract]]©2001 CIE-In this paper, we propose a binomial tree based parallel load-balancing method...
In this paper, we present a distributed computing framework for problems characterized by a highly i...
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is ...
International audienceThe most popular parallelization approach of the branch and bound algorithm co...