The Design and Analysis of Parallel Algorithms by Justin R. Smith

The Design and Analysis of Parallel Algorithms

byJustin R. Smith

Hardcover | June 1, 1995

not yet rated|write a review

Pricing and Purchase Info

$126.50

Earn 633 plum® points

Ships within 1-3 weeks

Ships free on orders over $25

Not available in stores

about

This text for students and professionals in computer science provides a valuable overview of current knowledge concerning parallel algorithms. These computer operations have recently acquired increased importance due to their ability to enhance the power of computers by permitting multipleprocessors to work on different parts of a problem independently and simultaneously. This approach has led to solutions of difficult problems in a number of vital fields, including artificial intelligence, image processing, and differential equations. As the first up-to-date summary of the topic,this book will be sought after by researchers, computer science professionals, and advanced students involved in parallel computing and parallel algorithms.

About The Author

Justin R. Smith is at Drexel University.
Triathlon - It HURTS: Inspiring stories on the path to becoming an Ironman
Triathlon - It HURTS: Inspiring stories on the path to becoming an Ironman

by Gary Smith

$10.69$13.31

Available for download

Not available in stores

The Chubby Vegetarian
The Chubby Vegetarian

by Justin Fox Burks

$10.69$13.31

Available for download

Not available in stores

Shop this author

Details & Specs

Title:The Design and Analysis of Parallel AlgorithmsFormat:HardcoverDimensions:528 pages, 10.04 × 7.48 × 0.03 inPublished:June 1, 1995Publisher:Oxford University Press

The following ISBNs are associated with this title:

ISBN - 10:0195078810

ISBN - 13:9780195078817

Customer Reviews of The Design and Analysis of Parallel Algorithms

Reviews

Extra Content

Table of Contents

Preface1. Basic Concepts1.1. Introduction2. Models of Parallel Computation2.1. Generalities2.2. The PRAM Model and a Sorting Algorithm2.3. Biotonic Sorting Algorithm2.4. Appendix: Proof of the 0-1 Principle2.5. Relations between PRAM Models2.6. Theoretical Issues2.7. General Principles of Parallel Algorithm Design3. Distributed-Memory Models3.1. Introduction3.2. Generic Parallel Algorithms3.3. The Butterfly Network3.4. The Hypercube Architecture3.5. The Shuffle-Exchange Network3.6. Cube-Connected Cycles3.7. Dataflow Computers3.8. The Granularity Problem4. Examples of Existing Parallel Computers4.1. Asynchronous Parallel Programming4.2. SIMD Programming: The Connection Machine4.3. Programming a MIMD-SIMD Hybrid Computer: Modula5. Numerical Algorithms5.1. Linear Algebra5.2. The Discrete fourier Transform5.3. Wavelets5.4. Partial Differential Equations6. A Survey of Symbolic Algorithms6.1. Doubling Algorithms6.2. Graph Algorithms6.3. Parsing and the Evaluation of Arithmetic Expressions6.4. Searching and Sorting6.5. Computer Algebra7. Probabilistic Algorithms7.1. Introduction and Basic Definitions7.2. The Class RNCAppendix A: Answers to Selected ExercisesAppendix B: Index of Notation

Editorial Reviews

"Overall, this book provides a thorough and broad coverage of numerous popular algorithms, including several example programs. The exercises at the ends of various sections should provide a lecturer in parallel algorithms with additional material for course and examination work."--TheComputer Journal