Abstract
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.
This work was supported by Army Research Office grant # DAAG29-84-K-0060 to the Artificial Intelligence Laboratory, and Office of Naval Research Grant N00014-86-K-0763 to the computer science department at the University of Texas at Austin.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Imai, Y. Yoshida, and T. Fukumura. A parallel searching scheme for multiprocessor systems and its application to combinatorial problems. In IJCAI, pages 416–418, 1979.
Virendra K. Janakiram, Dharma P. Agrawal, and Ram Mehrotra. Randomized parallel algorithms for prolog programs and backtracking applications. In Proceedings of International conference on Parallel Processing, pages 278–281, 1987.
Laveen Kanal and Vipin Kumar (editors). Search in Artificial Intelligence. Springer-Verlag, New York, 1988 (in press).
R.E. Korf. Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27:97–109, 1985. Also a chapter in 'search and Artificial Intelligence', Vipin Kumar and Laveen Kanal Eds, Springer-Verlag,1987(to appear).
Richard Korf. Personal communication. In the Univ. of California at Los Angeles, 1988.
W. Kornfeld. The use of parallelism to implement a heuristic search. In IJCAI, pages 575–580, 1981.
Vipin Kumar. Depth-first search. In Stuart C. Shapiro, editor, Encyclopaedia of Artificial Intelligence: Vol 2, pages 1004–1005, John Wiley and Sons, Inc., New York, 1987.
Vipin Kumar and Laveen N. Kanal. Parallel branch-and-bound formulations for and/or tree search. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-6, November 84.
Vipin Kumar, K. Ramesh, and V. Nageshwara Rao. Parallel heuristic search of state-space graphs: a summary of results. In Proceedings of the 1988 National Conference on Artificial Intelligence, August 1988. Also AI Lab Tech. Report 88-70, University of Texas at Austin, March 88.
Vipin Kumar and V. Nageshwara Rao. Parallel depth-first search, part II: analysis. International Journal of Parallel Programming, 16 (6), 1987.
Kouichi Kumon, Hideo Masuzawa, and Akihiro Itashaki. Kabu-wake: a new parallel inference method and its evaluation. In Digest of papers — IEEE Computer Society International Conference, pages 168–172, 1986.
T. H. Lai and Sartaj Sahni. Anomalies in parallel branch and bound algorithms. Communications of the ACM, 594–602, 1984.
Guo-Jie Li and Benjamin W. Wah. Computational Efficiency of Parallel Approximate Branch-and-Bound Algorithms. Technical Report TR-84-6, Purdue University, School of Electrical Engineering, FEBRUARY 84.
Guo-Jie Li and Benjamin W. Wah. Coping with anomalies in parallel branch-and-bound algorithms. IEEE Trans on Computers, C-35, June 1986.
R. Mehrotra and E. Gehringer. Superlinear speedup through randomized algorithms. In Proceedings of International conference on Parallel Processing, pages 291–300, 1985.
Joseph Mohan. Experience with two parallel programs solving the traveling salesman problem. In Proceedings of International conference on Parallel Processing, pages 191–193, 1983.
B. Monien, E. Spekenmeyer, and O. Vornberger. Superlinear Speedup for Parallel Backtracking. Technical Report 30, Univ. of Paderborn, FRG, 1986.
V. Nageshwara Rao, V. Kumar, and K. Ramesh. A parallel implementation of iterative-deepening-a*. In AAAI, pages 878–882, 1987. Also AI Lab TR 87-46, University of Texas at Austin, January 87.
V. Nageshwara Rao and Vipin Kumar. Parallel depth-first search, part I: implementation. International Journal of Parallel Programming, 16 (6), 1987.
D.S. Nau, V. Kumar, and L. Kanal. General branch-and-bound and its relation to a* and ao*. Artificial Intelligence, 23, 1984.
Nils J. Nilsson. Principles of Artificial Intelligence. Tioga Press, 1980.
Judea Pearl. Heuristics — Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading, MA, 1984.
Michael J. Quinn and Narsingh Deo. An upper bound for the speedup of parallel branch-and-bound algorithms. BIT, 6,No 1, March 1986.
H. Stone and P. Sipala. The average complexity of depth-first search with backtracking and cutoff. IBM Journal of Research and Development, May 1986.
Peter Tinker. Performance and pragmaticsof an OR-parallel logic programming system. International Journal of Parallel Programming, ?, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rao, V.N., Kumar, V. (1988). Superlinear speedup in parallel state-space search. In: Nori, K.V., Kumar, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1988. Lecture Notes in Computer Science, vol 338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50517-2_79
Download citation
DOI: https://doi.org/10.1007/3-540-50517-2_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50517-4
Online ISBN: 978-3-540-46030-5
eBook Packages: Springer Book Archive