Introduction to Parallel Computing Solution Manual

i Preface This instructors guide to accompany the text " Introduction to Parallel Computing " contains solutions to selected problems. For some problems the solution has been sketched, and the details have been left out. When solutions to problems are available directly in publications, references have been provided. Where necessary, the solutions are supplemented by figures. Figure and equation numbers are represented in roman numerals to differentiate them from the figures and equations in the text.

[1]  Richard Cole,et al.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.

[2]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[3]  K. Kimura,et al.  Probabilistic Analysis of the Optimal Efficiency of the Multi-Level Dynamic Load Balancing Scheme , 1991, The Sixth Distributed Memory Computing Conference, 1991. Proceedings.

[4]  Richard E. Korf,et al.  Distributed Tree Search and Its Application to Alpha-Beta Pruning , 1988, AAAI.

[5]  Jonathan Schaeffer,et al.  Parallel Sorting by Regular Sampling , 1992, J. Parallel Distributed Comput..

[6]  Sartaj Sahni,et al.  Hypercube computing: Connected components , 1989, The Journal of Supercomputing.

[7]  Shantanu Dutt,et al.  Scalable duplicate pruning strategies for parallel A* graph search , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[8]  Sartaj Sahni,et al.  Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.

[9]  E T. Leighton,et al.  Introduction to parallel algorithms and architectures , 1991 .

[10]  Vipin Kumar,et al.  Performance Properties of Large Scale Parallel Systems , 1993, J. Parallel Distributed Comput..

[11]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[12]  Vipin Kumar,et al.  Scalability of Parallel Algorithms for the All-Pairs Shortest-Path Problem , 1991, J. Parallel Distributed Comput..

[13]  Michael J. Quinn,et al.  Designing Efficient Algorithms for Parallel Computers , 1987 .

[14]  Vipin Kumar,et al.  Efficient algorithms for parallel sorting on mesh multicomputers , 1991, International Journal of Parallel Programming.

[15]  Guy E. Blelloch,et al.  A comparison of sorting algorithms for the connection machine CM-2 , 1991, SPAA '91.

[16]  Vipin Kumar,et al.  Scalable Load Balancing Techniques for Parallel Computers , 1994, J. Parallel Distributed Comput..

[17]  Thompson.  Fourier Transforms in VLSI , 1983, IEEE Transactions on Computers.

[18]  Vijay P. Kumar,et al.  Analyzing Scalability of Parallel Algorithms and Architectures , 1994, J. Parallel Distributed Comput..

[19]  R. Pavani,et al.  Parallel Numerical Linear Algebra , 1995, PDP.

[20]  Charles H. Romine,et al.  $LU$ Factorization Algorithms on Distributed-Memory Multiprocessor Architectures , 1988 .

[21]  Zheng Lin,et al.  A distributed fair polling scheme applied to OR-parallel logic programming , 1991, International Journal of Parallel Programming.

[22]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[23]  W. L. Ruzzo,et al.  ADAPTIVE PARALLEL ALGORITHMS FOR FINDING MINIMUM SPANNING TREES. , 1984 .

[24]  Sartaj Sahni,et al.  A Hypercube Algorithm for the 0/1 Knapsack Problem , 1988, J. Parallel Distributed Comput..

[25]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[26]  Sartaj Sahni,et al.  Hypercube algorithms for image processing and pattern recognition , 1990 .

[27]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[28]  S. Dutt,et al.  Parallel A* algorithms and their performance on hypercube multiprocessors , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.