By Topic

The efficiency of randomized parallel backtrack search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yanjun Zhang ; Dept. of Comput. Sci. & Eng., Southern Methodist Univ., Dallas, TX, USA ; Ortynski, A.

We present a refined analysis of the randomized parallel backtrack search algorithm (RPBS) of Karp and Zhang (1993). It is shown that the total number of messages occurred in the execution of RPBS is likely to be O(hp log d) where h and d are the height and degree of the backtrack search tree and p is the number of processors used. As a consequence, under the assumption of unit-time message delivery, the execution time of RPBS is likely to be n/p+O(h log d). Given its limited amount of communication, RPBS can be efficiently implemented in a message-passing or shared-memory multiprocessor systems. A general analysis of network implementation of RPBS is given. Some experimental data are also presented

Published in:

Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on

Date of Conference:

26-29 Oct 1994