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 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 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 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 Pawel Pawlewski (ed.) - InTech
The present monograph focuses on Petri Nets applications in two main areas: manufacturing and computer science. The theory of Petri Nets is still developing: some directions of investigations are presented in this volume.