Free eBook “Parallel Complexity Theory” by Ian Parberry. This research monograph contains information on the foundations of a complexity theory for parallel computation. Parallel Complexity Theory, formerly published by Pitman & Wiley in 1987. Parallel complexity theory, the study of resource-bounded parallel computation, is surely one of the fastest-growing areas of theoretical Computer Science (ed: this book was written in 1987).
In the light of this, it would be foolish to attempt an encyclopedic coverage of the field. However, it is the belief of the author that its foundations are becoming increasingly clear and well-defined. This monograph is an attempt to present these foundations in a unified and coherent manner. The material contained herein is aimed at advanced graduate students or researchers in theoretical Computer Science who wish to gain an insight into parallel complexity theory. It is assumed that the reader has (in addition to a certain level of mathematical majority) a general knowledge of Computer Science, and familiarity with automata theory, formal languages, complexity theory and analysis of algorithms. The interested reader may wish to augment his or her knowledge with books by Goldschlager and Lister, Hopcroft and Ullman, Garey and Johnson, and Aho, Hopcroft and Ullman.
Table of Contents
- Combinational Circuits
- Designing a Parallel Machine Model
- Variants of the Model
- Space and Parallel Time
- Parallel computation with Shared Memory Machines
- Programming Techniques for Feasible Networks
- The AKS Sorting Networks
- Simultaneous Resource Bounds
- More on Universal Machines
- Unbounded Fan-in Parallelism
File size: 8.63 MB
Number of pages: 212