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 Mark Anthony McLaughlin - arXiv
Internet distributed applications (IDAs) are internet applications with which many users interact simultaneously. In this paper the author provides a basis for a framework that combines IDAs collectively within a single context.
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 Colin Campbell, Ralph Johnson, Stephen Toub - Microsoft Press
A book that introduces .NET programmers to patterns for including parallelism in their applications. Examples of these patterns are parallel loops, parallel tasks and data aggregation with map-reduce. Each pattern has its own chapter.
by Ian Foster - Addison Wesley
Introduction to parallel programming and a guide for developing programs for parallel and distributed systems. Programs are developed in a methodical fashion and both cost and performance are considered at each stage in a design.