Parallel Complexity Theory
by Ian Parberry
Publisher: Prentice Hall 1987
Number of pages: 212
Parallel complexity theory is one of the fastest-growing fields in theoretical computer science. This rapid growth has led to a proliferation of parallel machine models and theoretical frameworks. This book presents a unified theory of parallel computation based on a network model.
Download or read it online for free here:
by C. Bischof, at al. - John von Neumann Institute for Computing
The book gives an overview of the developments, applications and future trends in high performance computing for all platforms. It addresses all aspects of parallel computing, including applications, hardware and software technologies.
by Henri Casanova, et al. - CRC Press
This book provides 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, etc.
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.
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.