This Article 
 Bibliographic References 
 Add to: 
Computational Efficiency of Parallel Combinatorial OR-Tree Searches
January 1990 (vol. 16 no. 1)
pp. 13-31

The performance of parallel combinatorial OR-tree searches is analytically evaluated. This performance depends on the complexity of the problem to be solved, the error allowance function, the dominance relation, and the search strategies. The exact performance may be difficult to predict due to the nondeterminism and anomalies of parallelism. The authors derive the performance bounds of parallel OR-tree searches with respect to the best-first, depth-first, and breadth-first strategies, and verify these bounds by simulation. They show that a near-linear speedup can be achieved with respect to a large number of processors for parallel OR-tree searches. Using the bounds developed, the authors derive sufficient conditions for assuring that parallelism will not degrade performance and necessary conditions for allowing parallelism to have a speedup greater than the ratio of the numbers of processors. These bounds and conditions provide the theoretical foundation for determining the number of processors required to assure a near-linear speedup.

[1] G. Baudet, "On the branching factor of the alpha-beta pruning algorithm,"Artificial Intell., vol. 10, no. 2, pp. 173-199, 1978.
[2] A. Ciepielewski and S. Haridi, "Execution of Bagof on the OR-parallel token machine," inProc. Int. Conf. Fifth Generation Computer Systems, ICOT and North-Holland, 1984, pp. 551-560.
[3] R. W. Conway, W. L. Maxwell, and L. W. Miller,Theory of Scheduling. Reading, MA: Addison-Wesley, 1967.
[4] R. A. Finkel and J. P. Fishbum, "Parallelism in alpha-beta search,"Artificial Intell., vol. 19, no. 1, pp. 89-106, 1982.
[5] C. L. Forgy, A. Gupta, A. Newell, and R. Wedig, "Initial assessment of architectures for production systems," inProc. Nat. Conf. Artificial Intelligence, AAAI, Aug. 1984, pp. 116-120.
[6] T. Ibaraki, "Theoretical comparisons of search strategies in branch-and-bound algorithms."Int. J. Comput. Inform. Sci., vol. 5, no. 4, pp. 315-343, 1976.
[7] T. Ibaraki, "Computational efficiency of approximate branch-and-bound algorithms,"Math. Oper. Res., vol. 1, no. 3, pp. 287-298, 1976.
[8] T. Ibaraki, "On the computational efficiency of branch-and-bound algorithms,"J. Oper. Res. Soc. Japan, vol. 20, no. 1, pp. 16-35, Mar. 1977.
[9] T. Ibaraki, "The power of dominance relations in branch-and-bound algorithms,"J. ACM, vol. 24, no. 2, pp. 264-279, 1977.
[10] M. Imai and T. Fukumura, " A parallelized branch-and-bound algorithm implementation and efficiency,"Syst., Comput., Contr., vol. 10, no. 3, pp. 62-70, June 1979.
[11] D. E. Knuth and R. W. Moore, "An analysis of alpha-beta pruning,"Artificial Intell., vol. 6, no. 4, pp. 293-326, 1975.
[12] W. Kohler and K. Steiglitz, "Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems,"J. ACM, vol. 21, no. 1, pp. 140-156, 1974.
[13] R. E. Korf, "Depth-first iterative deepening: An optimal admissible tree search,"Artificial Intell., vol. 25, pp. 97-109, 1985.
[14] R. E. Korf, "Real-time heuristic search: First results," inProc. Sixth Nat. Conf. Artificial Intelligence, Seattle, WA, June 1987. pp. 133-138.
[15] R. Kowalski,Logic for Problem Solving. New York: North-Holland, 1979.
[16] V. Kumar and L. N. Kanal. "A general branch and bound formulation for understanding and synthesizing and/or tree search procedures,"Artificial Intell., vol. 21, no. 1-2, pp. 179-198, 1983.
[17] V. Kumar and V. N. Rao, "Parallel depth-first search, Part II: Analysis,"Int. J. Parallel Program., vol. 16, no. 6, pp. 501-519, 1987.
[18] T.H. Lai and S. Sahni, "Anomalies in Parallel Branch-and-Bound Algorithms,"Comm. ACM, June 1984, pp. 594-602.
[19] T. H. Lai and A. Sprague, "Performance of parallel branch-and-bound algorithms," inProc. Int. Conf. Parallel Processing, IEEE, Aug. 1985. pp. 194-201.
[20] G. J. Li and B. W. Wah, "Computational efficiency of parallel approximate branch-and-bound algorithms," inProc. Int. Conf. Parallel Processing, IEEE, Aug. 1984, pp. 473-480.
[21] G. J. Li and B. W. Wah, "Computational efficiency of parallel approximate branch-and-bound algorithms," Purdue Univ., West Lafayette, IN, Tech. Rep. TR-EE-84-6, Mar. 1984.
[22] G. J. Li, "Parallel processing of combinatorial search problems," Ph.D. dissertation, School Elec. Eng., Purdue Univ., West Lafayette, IN, Dec. 1985.
[23] G.-J. Li and B. W. Wah, "Coping with anomalies in parallel branch-and-bound algorithms,"IEEE Trans. Comput., vol. C-35, pp. 568-573, June 1986.
[24] J. Mohan, "Experience with two parallel programs solving the traveling-salesman problem, " inProc. 1983 Int. Conf. Parallel Processing, 1983, pp. 191-193.
[25] T. Morin and R. Marsten, "Branch-and-bound strategies for dynamic programming,"Oper. Res., vol. 24, no. 4, pp. 611-627, 1976.
[26] D.S. Nau, V. Kumar, and L. Kanal, "General branch and bound, and its relation to A* and AO*,"Artif. Intell., vol. 23, pp. 29-58, 1984.
[27] J. Pearl, "The solution for the branching factor of the alpha-beta pruning algorithm and its optimality,"Commun. ACM, vol. 25, no. 8, pp. 559-564, 1982.
[28] V. N. Rao and V. Kumar, "Superlinear speedup in parallel state-space search,"Artificial Intell., Lab. Univ. Texas, Austin, TX, Tech. Rep. AI88-80, 1988.
[29] S. Sahni, "Algorithms for scheduling independent tasks,"J. ACM, vol. 23, no. 1, pp. 116-127, Jan. 1976.
[30] H. A. Simon and J. B. Kadane, "Optimal problem-solving search: All-or-none solutions,"Artificial Intell., vol. 6, no. 3, pp. 235-247, 1975.
[31] D. R. Smith, "Random trees and the analysis of branch-and-bound procedures,"J. ACM, vol. 31, no. 1, pp. 163-188, 1984.
[32] B. W. Wah and Y. W. Ma, "MANIP-A multicomputer architecture for solving combinatorial extremum problems,"IEEE Trans. Comput., vol. C-33, no. 5. pp. 377-390, May 1984.
[33] B. W. Wah and C. F. Yu, "Stochastic modeling of branch-and-bound algorithms with best-first search,"IEEE Trans. Software Eng., vol. SE-11, no. 9, pp. 922-934, Sept. 1985.
[34] B. W. Wah. G. J. Li, and C. F. Yu, "Multiprocessing of combinatorial search problems,"Computer. vol. 18. no. 6. pp. 93-108, June 1985.
[35] C. F. Yu and B. W. Wah, "Efficient branch-and-bound algorithms on a two-level memory system,"IEEE Trans. Software Eng., vol. SE-14, no. 9, pp. 1342-1356. Sept. 1988.

Index Terms:
near linear speedup; parallel combinatorial OR-tree searches; performance; error allowance function; dominance relation; search strategies; simulation; sufficient conditions; combinatorial mathematics; database management systems; decision theory; parallel processing; performance evaluation; theorem proving; trees (mathematics).
Guo-Jie Li, B.W. Wah, "Computational Efficiency of Parallel Combinatorial OR-Tree Searches," IEEE Transactions on Software Engineering, vol. 16, no. 1, pp. 13-31, Jan. 1990, doi:10.1109/32.44360
Usage of this product signifies your acceptance of the Terms of Use.