Issue No. 12 - December (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.9745
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,
parallel backtracking; randomization; speedups; interprocessor communication; high reliability; flexibility; fault tolerance; parallel algorithms; search problems.
V. Janakiram, R. Mehrotra and D. Agrawal, "A Randomized Parallel Backtracking Algorithm," in IEEE Transactions on Computers, vol. 37, no. , pp. 1665-1676, 1988.