Efficiency of randomized parallel backtrack search

Algorithmica (New York)

Volumn 24, Issue 1, 1999, Pages 14-28

  Zhang, Yanjun ^a   Ortynski, A ^b  

^a Research Group   (United States)

^b NORTEL NETWORKS   (United States)

Author keywords

Backtrack; Combinatorial search problem; Distributed computing; Parallel computation; Randomized algorithm

Indexed keywords

EID: 0042544189     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/pl00009269     Document Type: Article

References (16)

1. R. Blumofe and C. Leiserson. Scheduling multithreaded computations by work stealing. In Proceedings of the 35th Symposium on Foundations of Computer Science, pages 356-368, 1994.
2. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, and T. von Eicken, LogP: Towards a Realistic Model of Parallel Computation. Technical Report UCB/CSD 92/713, Computer Science Division, University of California, Berkeley, CA 94720, February 1993.
3. L. Carter, L. Stockmeyer, and M. Wegman. The complexity of backtrack searches. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 449-457, 1985.
4. E.W. Dijkstra, W. Feijen, and A. van Gasteren. Derivation of a termination detection algorithm for distributed computations. Information Processing Letters, 16:217-219, 1983.
5. R.A. Finkel and U. Manber. DIB - a distributed implementation of backtracking. ACM Transactions on Programming Languages and Systems, 9:235-256, 1987.
6. D.E. Knuth. Estimating the efficiency of backtrack programs. Mathematics of Computation, 29(129):121-136, 1975.
7. V. Kumar, A.Y. Grama, and V.N. Rao. Scalable load balancing techniques for parallel computers. Journal of Parallel and Distributed Computing, 22(1):60-79, 1994.
8. R.M. Karp and Y. Zhang. Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the ACM, 40:765-789, 1993.
9. P. Liu, W. Aiello, and S. Bhatt. An atomic model for message-passing. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 154-163, 1993.
10. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
11. A. Ortynski and Y. Zhang. An Iterative-Deepening Graph Coloring Algorithm. Technical Report 94-CSE-7, Southern Methodist University, Dallas, TX 75275, February 1994.
12. A. Ranade. Optimal speedup for backtrack on a butterfly network. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 44-48, 1991.
13. L.G. Valiant and G.J. Brebner. Universal schemes for parallel communication. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pages 263-277, 1981.
14. I.-C. Wu. Efficient parallel divide-and-conquer for a class of interconnection topologies. In Proceedings of the 2nd Annual International Symposium on Algorithms, 1991.
15. I.-C. Wu and H. Kung. Communication complexity for parallel divide-and-conquer. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, pages 151-162, 1991.
16. Y. Zhang and A. Ortynski. The efficiency of randomized parallel backtrack search. In Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, pages 522-529, 1994.