We discuss the implementation of heuristic search algorithms in a distributed problem solver whose processors interact according to the contract net protocol. Task distribution is viewed as a local mutual selection process based on a two-way transfer of information between processors with tasks to be executed and processors with knowledge-sources capable of executing those tasks. As an example of the approach, we consider the N Queens problem. We then derive measures of the speedup that can be expected from the application of a distributed processor to search problems that involve regular trees, and discuss the effect of coupling between processors on speedup. Bounds are developed for the number of processors that are required to achieve maximum speedup.
[1]
Reid G. Smith,et al.
A framework for problem solving in a distributed processing environment
,
1978
.
[2]
Reid G. Smith,et al.
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
,
1980,
IEEE Transactions on Computers.
[3]
Masaharu Imai,et al.
A Parallel Searching Scheme for Multiprocessor Systems and Its Application to Combinatorial Problems
,
1979,
IJCAI.
[4]
Raymond E. Carhart,et al.
Applications of artificial intelligence for chemical inference-XX. "Intelligent" use of constraints in computer-assisted structure elucidation
,
1977,
Comput. Chem..