Previous: Acknowledgements

References

1

S. Arvindam, V. Kumar and V. Rao. Efficient parallel algorithms for searching problems: Applications in VLSI CAD. 3rd Symp. Frontiers Mass. Par. Comp., Maryland (1990), 166--169.

2

N. Christofides and C. Whitlock. An algorithm for two-dimensional cutting problems. Operations Research 25, 1 (1977), 30--44.

3

E.C. Freuder and R.J. Wallace Partial constraint satisfaction. Artificial Intelligence 58(1992), 21--70.

4

A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek and V. Sunderam. PVM 3 User's Guide and Reference Manual. Oak Ridge National Laboratory, Knoxville, TN, Techn. Rep. ORNL/TM-12187, May 1994. ftp: cs.utk.edu.

5

R. Hempel, A.J.G. Hey, O. McBryan and D.W. Walker (eds.). Special Issue on Message Passing Interfaces. Parallel Computing 20,4(1994).

6

M. Held and R.M. Karp. The traveling salesman problem and minimum spanning trees. Operations Research 18 (1970), 1138--1162.

7

R.E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Art. Intell. 27 (1985), 97--109.

8

V. Kumar and V. Rao. Scalable parallel formulations of depth-first search. Kumar, Gopalakrishnan, Kanal (eds.), Par. Alg.\ for Mach. Intell. and Vision, Springer (1990), 1--41.

9

V. Kumar, A. Grama, A. Gupta and G. Karypis. Introduction to Parallel Computing. Design and Analysis of Algorithms. Benjamin/Cummings Publ., Redwood City, CA (1994).

10

Message Passing Interface Forum. MPI: A message-passing interface standard. Comp Sc. Dept., Univ. Tennessee, Knoxville, TN, CS-94-230, April 1994.

11

N.J. Nilsson. Principles of Artificial Intelligence. Tioga Publ., Palo Alto, CA, 1980.

12

Parsytec. Parix V1.3 PowerPC Software Documentation (Dec. 1994).

13

J. Pearl. Heuristics. Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading, MA, (1984).

14

V.N. Rao, V. Kumar and K. Ramesh. A parallel implementation of iterative-deepening A*. AAAI-87, 878--882.

15

V.N. Rao and V. Kumar. On the efficiency of parallel backtracking. IEEE Trans. Par. Distr. Systems 4,4(1993), 427--437.

16

D. Ratner and M. Warmuth. Finding a shortest solution for the extension of the 15-puzzle is intractable. AAAI-86, 168--172.

17

A. Reinefeld and T.A. Marsland. Enhanced iterative-deepening search. IEEE Trans. Pattern Analysis Mach. Intell., IEEE-PAMI, July 1994.

18

A. Reinefeld and V. Schnecke. Work-load balancing in highly parallel depth-first search. Procs. Scalable High Perf. Comp. Conf. SHPCC'94, Knoxville, 773--780.

19

A. Reinefeld and V. Schnecke. Performance of PVM on a highly parallel transputer system. First European PVM Users' Group Meeting, Rome, Italy, Oct. 1994.

20

T. Römke, M. Röttger, U. Schroeder and J. Simon. An Efficient Mapping Library for Parix. Procs. ZEUS'95 Workshop on Par. Programming and Computation, Linköping, Sweden (1995).

21

M. Röttger, U.P. Schroeder and J. Simon. Virtual Topologies Library for PARIX. University of Paderborn, Tech. Rep. tr-ri-94-148, 1994 (available via ftp or www).

22

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. W. Gentzsch, U. Harms (eds), HPCN-94, Munich (1994), Springer Lecture Notes 797, 253--259.

23

L. Stockmeyer. Optimal orientations of cells in silicon floorplan designs. Inform. and Control 57 (1983), 97--101.

24

V.S. Sunderam, G.A. Geist, J. Dongarra and R. Manchek. The PVM concurrent computing system: Evolution, experiences, and trends. Parallel Computing 20, 4(1994), 531--546.

25

K.V. Viswanathan and A. Bagchi. Best-first search methods for constrained two-dimensional cutting stock problems. Operations Research 41, 1993, 768--776.

26

T.-C. Wang and D. F. Wong. An Optimal Algorithm for Floorplan Area Optimization. Proc. 27th ACM/IEEE Design Automation Conf. 180--186, 1990.

27

S. Wimer, I. Koren and I. Cederbaum. Optimal aspect ratios of building blocks in VLSI. 25th ACM/IEEE Design Automation Conference, (1988), 66--72.