Scalable global and local hashing strategies for duplicate pruning in parallel A* graph search

IEEE Transactions on Parallel and Distributed Systems

Volumn 8, Issue 7, 1997, Pages 738-756

  Mahapatra, Nihar R ^a,b   Dutt, Shantanu ^a,c  

^a IEEE   (United States)

^b UNIVERSITY AT BUFFALO   (United States)

^c University of Illinois   (United States)

Author keywords

A* algorithm; Branch and bound search; Communication delay; Duplicate pruning; Graph search; Isoefficiency function; K ary n cubes; Parallel A*; Scalability; Traveling salesman problem

Indexed keywords

DATA COMMUNICATION SYSTEMS; DATA STORAGE EQUIPMENT; FUNCTIONS; GRAPH THEORY; INTERCONNECTION NETWORKS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; STATE SPACE METHODS;

COMBINATORIAL OPTIMIZATION PROBLEMS (COP); DUPLICATE PRUNING; HASH FUNCTIONS; TRAVELING SALEMAN PROBLEM (TSP);

PARALLEL ALGORITHMS;

EID: 0031175712     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.598348     Document Type: Article

References (28)

1. S. Anderson and M.C. Chen, "Parallel Branch-and-Bound Algorithms on the Hypercube," Proc. Second Conf. Hypercube Multiprocessors, pp. 309-317, 1987.
2. P.P. Chakrabarti, S. Ghose, A. Acharya, and S.C. De Sarkar, "Heuristic Search in Restricted Memory," Artificial Intelligence, vol. 41, pp. 197-221, 1989.
3. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. McGraw-Hill, 1990.
4. W.J. Dally, "Performance Analysis of k-ary n-cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1990.
5. S. Dutt and N.R. Mahapatra, "Parallel A* Algorithms and Their Performance on Hypercube Multiprocessors," Proc. Seventh Int'l Parallel Processing Symp., pp. 797-803, 1993.
6. S. Dutt and N.R. Mahapatra, "Scalable Load Balancing Strategies for Parallel A* Algorithms," J. Parallel and Distributed Computing, vol. 22, no. 3, pp. 488-505, Sept. 1994.
7. J. Eckstein, "Parallel Branch-and-Bound Algorithms for General Mixed Integer-Programming on the CM-5," Technical Report TMC-257, Thinking Machines Corp., Aug. 1993.
8. M. Evett, J. Hendler, A. Mahanti, and D. Nau, "PRA*: A Memory-Limited Heuristic Search Procedure for the Connection Machine," Proc. Third Symp. Frontiers of Massively Parallel Computation, pp. 145-149, College Park, Md., Oct. 8-10, 1990.
9. J.L. Hennessey and D.A. Patterson, Computer Architecture: A Quantitative Approach. San Mateo, Calif.: Morgan Kaufmann, 1990.
10. R.C. Holte, C. Drummond, and M.B. Perez, "Searching with Abstractions: A Unifying Framework and New High-Performance Algorithm," Proc. 10th Canadian Conf. Artificial Intelligence, pp. 263-270, 1994.
11. R.M. Karp and Y. Zhang, "Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation," J. ACM, vol. 40, no. 3, pp. 765-789, July 1993.
12. V. Kumar, K. Ramesh, and V.N. Rao, "Parallel Best-First Search of State-Space Graphs: A Summary of Results," Proc. Seventh Nat' Conf. Artificial Intelligence (AAAI 88), vol. 1, pp. 122-127, Saint Paul, Minn., Aug. 21-26, 1988.
13. V. Kumar and V.N. Rao, "Load Balancing on the Hypercube Architecture," Proc. Fourth Conf. Hypercubes, Concurrent Computers and Applications, vol. 1, pp. 603-608, Monterey, Calif., Mar. 6-8, 1989.
14. D.E. Knuth, "Sorting and Searching," The Art of Computer Programming, vol. 3. Addison-Wesley, 1973.
15. E.L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart, and Winston, 1976.
16. J.D. Little et al., "An Algorithm for the Traveling Salesman Problem," Operations Research, vol. 11, no. 6, pp. 972-989, 1963.
17. R. Luling and B. Monien, "Load Balancing for Distributed Branch & Bound Algorithms," Proc. Sixth Int'l Parallel Processing Symp., pp. 543-548, Beverly Hills, Calif., Mar. 23-26, 1992.
18. N.R. Mahapatra and S. Dutt, "New Anticipatory Load Balancing Strategies for Parallel A* Algorithms," Am. Math. Society's Proc. DIMACS Series in Discrete Math, and Theoretical Computer Science, vol. 22, pp. 197-232, 1995.
19. N.R. Mahapatra and S. Dutt, "An Efficient Delay-Optimal Distributed Termination Detection Algorithm," submitted to IEEE Trans. Parallel and Distributed Systems.
20. G. Manzini and M. Somalvico, "Probabilistic Performance Analysis of Heuristic Search Using Parallel Hash Tables," Proc. Int'l Symp. Artificial Intelligence and Math., Ft. Lauderdale, Fla., Jan 1990.
21. D.L. Miller and J.F. Pekny, "Results from a Parallel Branch and Bound Algorithm for Solving Large Asymmetric Traveling Salesman Problems," Operations Research Letters, vol. 8, pp. 129-135, 1989.
22. J. Mohan, "Experience with Two Parallel Programs Solving the Traveling Salesman Problem," Proc. 1983 Int'l Conf. Parallel Processing, pp. 191-193, Bellaire, Mich., Aug. 23-26, 1983.
23. E. Rich, Artificial Intelligence. New York: McGraw-Hill, 1983.
24. V.A. Saletore, "A Distributed and Adaptive Dynamic Load Balancing Scheme for Parallel Processing of Medium-Grain Tasks," Proc. Fifth Distributed Memory Computing Conf., 1990.
25. A.K. Sen and A. Bagchi, "Fast Recursive Formulations for Best-First Search that Allow Controlled Use of Memory," Proc. 11th Int'l Joint Conf. Artificial Intelligence (IJCAI-89), pp. 297-302, Detroit, Mich., Aug. 2-25, 1989.
26. N.A. Sherwani, Algorithms for VLSI Physical Design Automation. Norwell, Mass.: Kluwer Academic Publishers, 1993.
27. D.R. Smith, "Random Trees and the Analysis of Branch-and-Bound Procedures," J. ACM, vol. 31, no. 1, pp. 163-188, Jan 1984.
28. B.W. Wah and Y.W.E. Ma, "MANIP - A Parallel Computer System for Implementing Branch and Bound Algorithms," Proc. Eighth Ann. Symp. Computer Architecture, pp. 239-262, Minneapolis, Minn., May 12-14, 1981.