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 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 Norm Matloff - University of California, Davis
This book is aimed more on the practical end of things, real code is featured throughout. The emphasis is on clarity of the techniques and languages used. It is assumed that the student is reasonably adept in programming and linear algebra.
by Hank Dietz - The Aggregate
This document discusses the basic approaches to parallel processing available to Linux users: SMP Linux systems, clusters of networked Linux systems, parallel execution using multimedia instructions, and attached processors hosted by a Linux system.
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.