Selim G. Akl, Queen's University

Published November, 1996 by Prentice Hall Engineering/Science/Mathematics

Copyright 1997, 608 pp.
Paper
ISBN 0-13-147034-5
$74.00

Sign up for future
mailings on this subject.

See other books about:
    Algorithms

This book focuses throughout on models of computation and methods of problem solving. This text shows how a parallel algorithm can be designed for a given computational problem to run on a parallel computer, and then how it can be analyzed to determine its goodness.

The book covers in detail the main three models of computation used to design parallel algorithms (namely combinational circuits, shared memory machines, and interconnection networks). The algorithms are grouped by method of design (prefix computation, divide and conquer, and pointer based methods. Algorithms are described for interconnection networks varying from the simplest (linear array) to the most advanced (star). A chapter on bus-based models covers a current topic that has not received textbook treatment previously. This book organizes content around the twin themes of models of computation and methods of problem solving. It presents models that characterize and distinguish parallel computation — combinational circuits, interconnection networks, and shared memory machines, as well as models which use buses. Each chapter comprises a well thought out set of problems, and ends with comprehensive bibliographical remarks. A set of problems and comprehensive bibliographical remarks for each chapter is provided.

1. Introduction.
2. Models of Computation.
3. Combinational Circuits.
4. Parallel Prefix Computation.
5. Divide and Conquer.
6. Pointer-Based Data Structures.
7. Linear Arrays.
8. Meshes and Related Models.
9. Hypercubes and Stars.
10. Models Using Buses.
11. Broadcasting with Selective Reduction.
12. Parallel Synergy.
Bibliography.
Index.