Parallel search in discrete optimization problems

Simulation Practice and Theory

Volumn 4, Issue 2-3 SPEC. ISS., 1996, Pages 169-188

  Reinefeld, Alexander ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Backtracking; Dynamical load balancing; Parallel combinatorial optimization

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; HEURISTIC METHODS; OPERATIONS RESEARCH; OPTIMIZATION;

BACKTRACKING; DYNAMIC LOAD BALANCING; PARALLEL COMBINATORIAL OPTIMIZATION; PARALLEL SEARCH;

PARALLEL PROCESSING SYSTEMS;

EID: 0030146202     PISSN: 09284869     EISSN: None     Source Type: Journal    
DOI: 10.1016/0928-4869(95)00036-4     Document Type: Article

References (42)

1. S. Arvindam, V. Kumar and V. Rao, Efficient parallel algorithms for searching problems: Applications in VLSI CAD, in: Proceedings of the 3rd Symposium on Frontiers Massively Parallel Computing, Maryland (1990) 166-169.
2. A. Beguelin, J. Dongarra, G.A. Geist, R. Manchek and V. Sunderam, A users' guide to PVM parallel virtual machine, Technical Report ORNL/TM-11826, Oak Ridge National Laboratory, July 1991.
3. N. Christofides and C. Whitlock, An algorithm for two-dimensional cutting problems, Oper. Res. 25 (1977) 30-44.
4. D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian and T. van Eicken, LogP: Towards a realistic model of parallel computation, in: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego (1993).
5. E. Dijkstra, W.H.J. Feijen and A.J.M. van Gasteren, Derivation of a termination detection algorithm for distributed computation, Inform. Process. Lett. 16 (1983) 217-219.
6. O.I. El-Dessouki and W.H. Huen, Distributed enumeration on network computers, in: Proceedings of the 1979 International Conference on Parallel Processing, 137-146.
7. R. Finkel and U. Manber, DIB - A distributed implementation of backtracking, in: Proceedings of the 5th Conference on Distributed Computer Systems, Denver (1985) 446-452.
8. B.C. Freuder and R.J. Wallace, Partial constraint satisfaction, Artificial Intelligence 58 (1992) 21-70.
9. A. Grama, V. Kumar and P. Pardalos, Parallel Processing of Discrete Optimization Problems, Encyclopedia of Microcomputers (Marcel Dekker, New York, 1992).
10. A. Gupta and V. Kumar, Performance properties of large scale parallel systems, J. Parallel Distributed Comput. 19 (1993) 234-244.
11. M. Held and R.M. Karp, The traveling salesman problem and minimum spanning trees, Oper. Res. 18 (1970) 1138-1162.
12. G.A.P. Kindervater and J.K. Lenstra, Parallel computing in combinatorial optimization, Ann. of Oper. Res. 14 (1988) 245-289.
13. D.E. Knuth and R.W. Moore, An analysis of alpha-beta pruning, Artificial Intelligence 6 (1975) 293-326.
14. R.E. Korf, Depth-first iterative-deepening: An optimal admissible tree search, Artificial Intelligence 27 (1985) 97-109.
15. V. Kumar and V. Rao, Scalable parallel formulations of depth-first search, in: V. Kumar, P.S. Gopalakrishnan and L.N. Kanal, eds., Parallel Algorithms for Machine Intelligence and Vision (Springer, Berlin, 1990) 1-41.
16. V. Kumar, A. Grama, A. Gupta and G. Karypis, Introduction to Parallel Computing. Design and Analysis of Algorithms (Benjamin/Cummings, Redwood City, CA, 1994).
17. V. Kumar, D.S. Nau and L. Kanal, A general branch-and-bound formulation for AND/OR graph and game-tree search, in: L. Kanal and V. Kumar, eds., Search in Artificial Intelligence (Springer, Berlin, 1988) 91-130.
18. P.B. Ladkin and A. Reinefeld, Effective solution of qualitative interval constraint problems, Artificial Intelligence 57 (1992) 105-124.
19. E.L. Lawler and D.E. Wood, Branch and bound methods: A survey, Oper. Res. 14 (1966) 600-719.
20. R. Lüling and B. Monien, Load balancing for distributed branch & bound algorithms, in: Proceedings of the International Parallel Processing Symposium (1992).
21. R. Lüling, B. Monien and S. Tschöcke, Load balancing for distributed branch & bound algorithms: Experiments and theory, in: Proceedings of the DIMACS Workshop "Parallel Processing of Discrete Optimization Problems" (1994).
22. A. Mahanti, S. Ghosh, D.S. Nau, A.K. Pal and L. Kanal, Performance of IDA* on trees and graphs, in: Proceedings of the 10th National Conference on Artificial Intelligence, San Jose (1992) 539-544.
23. R.N. Morabito, M.N. Arenales and V.F. Arcaro, An and-or-graph approach for two dimensional cutting problems, European J. Oper. Res. 58 (1992) 263-271.
24. N.J. Nilsson, Principles of Artificial Intelligence (Tioga, Palo Alto, CA, 1980).
25. Parsytec Computer GmbH., Parix VI.3 PowerPC Software Documentation (1994).
26. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982).
27. J. Pearl, Heuristics. Intelligent Search Strategies for Computer Problem Solving (Addison-Wesley, Reading, MA, 1984).
28. C. Powley and R.E. Korf, Single-agent parallel window search, IEEE Trans. Pattern Analysis Machine Intelligence 13 (1991) 466-477.
29. A. Ranade, Optimal speedup for backtracking search on a butterfly network, in: Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architecture (1991) 40-48.
30. V.N. Rao, V. Kumar and K. Ramesh, A parallel implementation of iterative-deepening A*, in: Proceedings of the AAAI-87, 878-882.
31. V.N. Rao and V. Kumar, On the efficiency of parallel backtracking, IEEE Trans. Par. Distributed Systems 4 (1993) 427-437.
32. D. Ratner and M. Warmuth, Finding a shortest solution for the N × N extension of the 15-puzzle is intractable, in: Proceedings of the AAAI-86, 168-172.
33. A. Reinefeld and T.A. Marsland, Enhanced iterative-deepening search, IEEE Trans. Pattern Analysis Machine Intelligence 16 (1994) 701-710.
34. A. Reinefeld and V. Schnecke, AIDA* - Asynchronous Parallel IDA*, in: Proceedings of the 10th Canadian Conference on Artificial Intelligence AI'94, Banff, Canada (Morgan Kaufman, Los Altos, CA, 1994) 295-302.
35. A. Reinefeld and V. Schnecke, Work-load balancing in highly parallel depth-first search, in: Proceedings of the Scalable High Performance Computing Conference SHPCC'94, Knoxville, TN, 1994, pp. 773-780.
36. A. Reinefeld and V. Schnecke, Performance of PVM on a highly parallel transputer system, in: Proceedings of the First European PVM Users' Group Meeting, Rome, Italy (1994); Also: http://www.uni-paderborn.de/pcpc/publications.
37. T. Römke, M. Röttger, U. Schroeder and J. Simon, On efficient embeddings of grids into grids in PARIX, in: Proceedings of the International Conference on Parallel Processing EURO-PAR 95, Stockholm, Sweden (1995); Also: http://www.uni-paderborn.de/pcpc/publications/1995/.
38. V. Saletore and L.V. Kale, Consistent linear speedup to a first solution in parallel state-space search, in: Proceedings of the 1990 National Conference on Artificial Intelligence (1990) 227-233.
39. P.M.A. Sloot, A. Hoekstra and L.O. Hertzberger, A comparison of the IServer-OCCAM, Parix, Express and PVM programming environments on a Parsytec GCel, in: W. Gentzsch and U. Harms, eds., HPCN-94, Munich, Lecture Notes 797 (Springer, Berlin, 1994) 253-259.
40. G.C. Stockman, A minimax algorithm faster than alpha-beta?, Artificial Intelligence 12 (1979) 179-196
41. L. Stockmeyer, Optimal orientations of cells in silicon floorplan designs, Inform. and Control 57 (1983) 97-101.
42. S. Wimer, I. Koren and I. Cederbaum, Optimal aspect ratios of building blocks in VLSI, in: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988) 66-72.