Tree Shaped Computations as a Model for Parallel Applications

It is shown how a large class of applications can be parallelized by modeling them as tree shaped computations. In particular this class contains many highly irregular and completely unpredictable computations as they occur in heuristic search. We explain why the model even remains useful in the presence of some frequently observed subproblem dependencies.

[1]  Peter Sanders,et al.  A Scalable Parallel Tree Search Library , 1996 .

[2]  Katherine Yelick,et al.  Randomized load balancing for tree-structured computation , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[3]  Rainer Feldmann,et al.  Game Tree Search on Massively Parallel Systems , 1993 .

[4]  Vipin Kumar,et al.  Automatic test pattern generation on parallel processors , 1991, Parallel Comput..

[5]  Matteo Frigo,et al.  An analysis of dag-consistent distributed shared-memory algorithms , 1996, SPAA '96.

[6]  Robert D. Blumofe,et al.  Scheduling multithreaded computations by work stealing , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  Christos Goumopoulos,et al.  Parallel Crew Scheduling on Workstation Networks Using PVM , 1997, PVM/MPI.

[8]  Udi Manber,et al.  DIB—a distributed implementation of backtracking , 1987, TOPL.

[9]  Vipin Kumar,et al.  On the Efficiency of Parallel Backtracking , 1993, IEEE Trans. Parallel Distributed Syst..

[10]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[11]  Jürg Nievergelt,et al.  The parallel search bench ZRAM and its applications , 1999, Ann. Oper. Res..

[12]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[13]  Wolfgang Ertel.  Parallele Suche mit randomisiertem Wettbewerb in Inferenzsystemen , 1993, DISKI.

[14]  Peter Sanders.  Lastverteilungsalgorithmen für parallele Tiefensuche , 1997 .

[15]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

[16]  Peter Sanders.  Massively Parallel Search for Transition-Tables of Polyautomata , 1994, Parcella.

[17]  G.S. Bloom,et al.  Applications of numbered undirected graphs , 1977, Proceedings of the IEEE.

[18]  Amnon Barak,et al.  An adaptive granularity control algorithm for the parallel execution of functional programs , 1993, Future Gener. Comput. Syst..

[19]  Burkhard Monien,et al.  Studying overheads in massively parallel MIN/MAX-tree evaluation , 1994, SPAA '94.

[20]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[21]  Oliver Vornberger,et al.  Superlinear Speedup for Parallel Backtracking , 1987, ICS.

[22]  Jacques Chassin de Kergommeaux,et al.  Parallel logic programming systems , 1994, CSUR.