Parallel Algorithms
by Henri Casanova, et al.
Publisher: CRC Press 2008
Number of pages: 348
Description:
The aim of this book is to provide a rigorous yet accessible treatment of parallel algorithms, including theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and fundamental notions of scheduling. The focus is on algorithms for distributed-memory parallel architectures in which computing elements communicate by exchanging messages.
Download or read it online for free here:
Download link
(2.8MB, PDF)
Similar books

by Sabu M. Thampi - arXiv
An overview of distributed computing systems. The definition, architecture, characteristics of distributed systems and the various fallacies are discussed. Finally, discusses client/server computing, World Wide Web and types of distributed systems.
(10199 views)

by Colin Campbell, Ralph Johnson, Stephen Toub - Microsoft Press
A book that introduces .NET programmers to patterns for including parallelism in their applications. Examples of these patterns are parallel loops, parallel tasks and data aggregation with map-reduce. Each pattern has its own chapter.
(15828 views)

by Nicholas Carriero, David Gelernter - MIT Press
In the near future every programmer will need to understand parallelism, a powerful way to run programs fast. The authors of this straightforward tutorial provide the instruction that will transform ordinary programmers into parallel programmers.
(10493 views)

by Guy Blelloch - The MIT Press
Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.
(12968 views)