The Design and Analysis of Parallel Algorithms

The Design and Analysis of Parallel Algorithms

By (author) 

List price: US$125.00

Currently unavailable

We can notify you when this item is back in stock

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Parallel algorithms - computer operations designed to be performed independently - have recently increased in importance. Because today's computer applications require more power than can physically be provided by current machines, computing power can only be increased by having multiple processors work on different parts of a problem independently and simultaneously. Parallel algorithms are the operations that make parallel processing possible. This book provide an overview of the current knowledge of parallel algorithms for both students and more

Product details

  • Hardback | 528 pages
  • 165.1 x 241.3 x 38.1mm | 1,156.65g
  • Oxford University Press Inc
  • New York, United States
  • English
  • 0195078810
  • 9780195078817

Table of contents

Preface. 1: Basic Concepts. 1.1: Introduction. 2: Models of Parallel Computation. 2.1: Generalities. 2.2: The PRAM Model and a Sorting Algorithm. 2.3: Biotonic Sorting Algorithm. 2.4: Appendix: Proof of the 0-1 Principle. 2.5: Relations between PRAM Models. 2.6: Theoretical Issues. 2.7: General Principles of Parallel Algorithm Design. 3: Distributed-Memory Models. 3.1: Introduction. 3.2: Generic Parallel Algorithms. 3.3: The Butterfly Network. 3.4: The Hypercube Architecture. 3.5: The Shuffle-Exchange Network. 3.6: Cube-Connected Cycles. 3.7: Dataflow Computers. 3.8: The Granularity Problem. 4: Examples of Existing Parallel Computers. 4.1: Asynchronous Parallel Programming. 4.2: SIMD Programming: The Connection Machine. 4.3: Programming a MIMD-SIMD Hybrid Computer: Modula. 5: Numerical Algorithms. 5.1: Linear Algebra. 5.2: The Discrete fourier Transform. 5.3: Wavelets. 5.4: Partial Differential Equations. 6: A Survey of Symbolic Algorithms. 6.1: Doubling Algorithms. 6.2: Graph Algorithms. 6.3: Parsing and the Evaluation of Arithmetic Expressions. 6.4: Searching and Sorting. 6.5: Computer Algebra. 7: Probabilistic Algorithms. 7.1: Introduction and Basic Definitions. 7.2: The Class RNC. Appendix A: Answers to Selected Exercises. Appendix B: Index of Notationshow more