+612 9045 4394
 
CHECKOUT
Design Analysis Parallel Algorithm - Justin R. Smith

Design Analysis Parallel Algorithm

Hardcover

Published: 4th February 1993
RRP $196.95
$125.50
36%
OFF
or 4 easy payments of $31.38 with Learn more
This title is not in stock at the Booktopia Warehouse and needs to be ordered from our supplier.
Click here to read more about delivery expectations.

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 multiple processors 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.

"He devotes 156 pages to parallel architectures, in the only handy summary I gave seen. The approach is motivational, covering a most remarkable range of topics that make it valuable to me as an alternative to review journals and other sources." --SCS Simulator Quarterly "The main focus of this book is on the development of parallel algorithms for numerical and scientific computing on 'massively parallel' computers. . . . A wealth of useful algorithms is presented throughout the book and a considerable number of practical problems is set in each chapter."--Mathematical 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."--The Computer Journal

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 Notation

ISBN: 9780195078817
ISBN-10: 0195078810
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 528
Published: 4th February 1993
Publisher: Oxford University Press Inc
Country of Publication: US
Dimensions (cm): 25.0 x 19.0  x 3.18
Weight (kg): 1.12