Parallel Algorithms

Henri Casanova, Arnaud Legrand, Yves Robert

July 17, 2008 by Chapman and Hall/CRC
Textbook - 360 Pages - 119 B/W Illustrations
ISBN 9781584889458 - CAT# C9454
Series: Chapman & Hall/CRC Numerical Analysis and Scientific Computing Series

USD$99.95

Add to Wish List
FREE Standard Shipping!

Features

  • Demonstrates the use of theoretical parallel computing models in practice, offering valuable insight into the design of parallel algorithms
  • Explains network principles relevant to parallel algorithm design and performance
  • Provides a unified, rigorous approach to performance modeling, showing how to recognize performance trade-offs and develop sound performance models with a variety of assumptions
  • Contains in-depth coverage of basic and recent scheduling results
  • Uses many examples, case studies, exercises, and solutions to illustrate the principles
  • Summary

    Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms presents a rigorous yet accessible treatment of theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling. The book extracts fundamental ideas and algorithmic principles from the mass of parallel algorithm expertise and practical implementations developed over the last few decades.

    In the first section of the text, the authors cover two classical theoretical models of parallel computation (PRAMs and sorting networks), describe network models for topology and performance, and define several classical communication primitives. The next part deals with parallel algorithms on ring and grid logical topologies as well as the issue of load balancing on heterogeneous computing platforms. The final section presents basic results and approaches for common scheduling problems that arise when developing parallel algorithms. It also discusses advanced scheduling topics, such as divisible load scheduling and steady-state scheduling.

    With numerous examples and exercises in each chapter, this text encompasses both the theoretical foundations of parallel algorithms and practical parallel algorithm design.

    Instructors

    We provide complimentary e-inspection copies of primary textbooks to instructors considering our books for course adoption.

    Request an
    e-inspection copy

    Share this Title