When N processors perform depth-first search on disjoint parts of a state space tree to find a solution, the speedup can be superlinear (i.e., > N) or sublinear (i.e., <N) depending upon when a solution is first encountered in the space by one of the processors. It may appear that on the average, the speedup would be either linear or sublinear. Using an analytical model, we show that if the search space has more than one solution and if these solutions are randomly distributed in a relatively small region of the search space, then the average speedup in parallel depth-first search can be superlinear. If all the solutions (one or more) are uniformly distributed over the whole search space, then the average speedup is linear. This model is validated by our experiments on synthetic state-space trees and the 15-puzzle problem. The same model predicts average superlinear speedup in parallel best-first branch-and-bound algorithms on suitable problems.
|Original language||English (US)|
|Title of host publication||Foundations of Software Technology and Theoretical Computer Science - 8th Conference, Proceedings|
|Editors||Kesav V. Nori, Sanjeev Kumar|
|Number of pages||14|
|State||Published - 1988|
|Event||8th International Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1988 - Pune, India|
Duration: Dec 21 1988 → Dec 23 1988
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||8th International Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1988|
|Period||12/21/88 → 12/23/88|
Bibliographical noteFunding Information:
Consider the problem of finding a solution in a state-space tree containing one or more solutions [3,22,21]. Depth-first search (DFS) is a widely used technique for solving such problems[7,22]. A number of parallel formulations of depth-first search have been developed by various researchers [18,10,6,1,17,11]. In one such formulation, N processors concurrently perform depth-first search in disjoint parts of a state-space tree to find a solution in the search space. The parts of the state-space searched by different processors are determined dynamically, and are roughly of equal sizes. Since rally one solution is needed, the search terminates whenever any of the processors encounters a solution. Depending upon when a solution is first encountered in the space by the processors, the speedup can be superlinear (i.e., > N) or sublinear (i.e., < N) 1. This phenomenon of speedup being greater than N on N processors in isolated executions of parallel depth-first search has been reported by many researchers [6,18,17,1,25]. The speedup can differ greatly from one execution to another, as the actual parts of the search space searched by different processors are determined dynamically, and can be different for different executions. Hence *This work was supported by Army Research Office grant # DAAG29-84-K-0060t o the Artificial Intelligence Laboratory, and Office of Naval Research Grant N00014-86-K-0763 to the computer science department at the Universityo f Texas at Aust'm. 1This phenomenoni s also referred to as 'speedup anomalies'.
© 1988, Springer-Verlag.
Copyright 2017 Elsevier B.V., All rights reserved.