Issue No. 01 - January (1990 vol. 16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.44360
<p>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.</p>
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).
G. Li and B. Wah, "Computational Efficiency of Parallel Combinatorial OR-Tree Searches," in IEEE Transactions on Software Engineering, vol. 16, no. , pp. 13-31, 1990.