Parallel Complexity Theory
by Ian Parberry
Publisher: Prentice Hall 1987
ISBN/ASIN: 0273087835
ISBN-13: 9780273087830
Number of pages: 212
Description:
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:
Download link
(8.6MB, PDF)
Similar books
Is Parallel Programming Hard, And, If So, What Can You Do About It?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.
(15640 views)
The Practice of Parallel Programmingby Sergey A. Babkin - CreateSpace
This book provides an advanced guide to the issues of the parallel and multithreaded programming. It goes beyond the high-level design of the applications, into the details that are often overlooked but vital to make the programs work.
(24511 views)
Vector Models for Data-Parallel Computingby 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.
(14236 views)
Parallel Algorithmsby 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.
(7904 views)