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 Al Geist, at al. - The MIT Press
Written by the team that developed the software, this tutorial is the definitive resource for scientists, engineers, and other computer users who want to use PVM to increase the flexibility and power of their high-performance computing resources.
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.
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 Ian Parberry - Prentice Hall
The rapid growth of parallel complexity theory has led to a proliferation of parallel machine models. This book presents a unified theory of parallel computation based on a network model. It is the first such synthesis in book form.