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. It extracts fundamental ideas and algorithmic principles from the mass of parallel algorithm expertise and practical implementations developed over the last few decades. With many examples, case studies, exercises, and solutions in each chapter, the text encompasses both the theoretical foundations of parallel algorithms and practical parallel algorithm design.

Henri Casanova, Arnaud Legran, Yves Robert

Preface. Models. Parallel Algorithms. Scheduling. Bibliography. Index.