This Article 
 Bibliographic References 
 Add to: 
A Randomized Parallel Backtracking Algorithm
December 1988 (vol. 37 no. 12)
pp. 1665-1676
A technique for parallel backtracking using randomization is proposed. Its main advantage is that good speedups are possible with little or no interprocessor communication. The speedup obtainable is problem-dependent. In those cases where the problem size becomes very large, randomization is extremely successful achieving good speedups. The technique also ensures high reliability, flexibility,

[1] E. Shapiro, "A subset of Concurrent PROLOG and its interpreter," ICOT Tech. Rep. TR003, Feb. 1983.
[2] K. L. Clark and S. Gregory, "PARLOG: Parallel programming in logic,"ACM Trans. Program. Lang., vol. 8, pp. 1-49, 1986.
[3] B. W. Wah and Y. W. Eva Ma, "MANIP--A multicomputer architecture for solving combinatorial extremum-search problems,"IEEE Trans. Comput., vol. C-33, pp. 377-390, May 1984.
[4] D. R. Smith, "Random trees and the analysis of branch-and-bound procedures,"J. ACM, vol. 31, no. 1, pp. 163-188, 1984.
[5] J. Riordan,An Introduction to Combinatorial Analysis. Princeton, NJ: Princeton Univ. Press, 1978.
[6] W. Feller,An Introduction to Probability Theory and Applications. New York: Wiley, 1971.
[7] E. D. Brooks, "A multitasking kernal for the C and Fortran programming languages," Tech. Rep. UCID 20167, Lawrence Livermore Nat. Lab., Livermore, CA, Sept. 1984.

Index Terms:
parallel backtracking; randomization; speedups; interprocessor communication; high reliability; flexibility; fault tolerance; parallel algorithms; search problems.
V.K. Janakiram, D.P. Agrawal, R. Mehrotra, "A Randomized Parallel Backtracking Algorithm," IEEE Transactions on Computers, vol. 37, no. 12, pp. 1665-1676, Dec. 1988, doi:10.1109/12.9745
Usage of this product signifies your acceptance of the Terms of Use.