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 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 Earl T. Campbell, Joseph Fitzsimons - arXiv
This review provides a gentle introduction to one-way quantum computing in distributed architectures. One-way quantum computation shows significant promise as a model for distributed systems, particularly probabilistic entangling operations.
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 Robert Virding, Claes Wikstrom, Mike Williams - Prentice Hall PTR
A tutorial of Erlang, a concurrent, functional programming language. The emphasis of this book is on learning through example and a number of well known problems in designing and programming concurrent fault-tolerant real-time systems.