by Henri Casanova, et al.
Publisher: CRC Press 2008
Number of pages: 348
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.
Home page url
Download or read it online for free here:
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.
by Sergio Barbarossa, Stefania Sardellitti, Paolo Di Lorenzo - arXiv
We consider the problems of distributed detection and estimation in wireless sensor networks. We provide a general framework aimed to show how an efficient design of a sensor network requires a joint organization of in-network communication.
by Dimitri P. Bertsekas, John Tsitsiklis - Athena Scientific
This is a comprehensive and theoretically sound treatment of parallel and distributed numerical methods. It focuses on algorithms that are naturally suited for massive parallelization, and it explores the issues associated with such algorithms.
by Paul E. McKenney
The purpose of this book is to help you understand how to program shared-memory parallel machines. By describing the algorithms that have worked well in the past, we hope to help you avoid some of the pitfalls that have beset parallel projects.