The Design and Analysis of Parallel Algorithms

AvJustin R. Smith,Drexel University) Smith, Justin R. (Associate Professor, Department of Mathematics and Computer Science, Associate Professor, Department of Mathematics and Computer Science

Inbunden, Engelska, 1993

1 892 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

Parallel algorithms, i.e. 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 professionals.

Produktinformation

Utgivningsdatum:1993-05-06
Mått:264 x 194 x 31 mm
Vikt:1 106 g
Format:Inbunden
Språk:Engelska
Antal sidor:528
Förlag:OUP USA
ISBN:9780195078817

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

Recensioner i media

... a thorough and broad coverage of numerous popular algorithms, including several example programs. The exercises should provide a lecturer in parallel algorithms with additional material for course and examination work. The Computer Journal, Volume 39, No. 6, 1996

Innehållsförteckning

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