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 Mikito Takada - mixu.net
This text provides a more accessible introduction to distributed systems. The book brings together the ideas behind many of the more recent distributed systems - such as Amazon's Dynamo, Google's BigTable and MapReduce, Apache's Hadoop and so on.
by Norm Matloff - University of California, Davis
This book is aimed more on the practical end of things, real code is featured throughout. The emphasis is on clarity of the techniques and languages used. It is assumed that the student is reasonably adept in programming and linear algebra.
by Nicholas Carriero, David Gelernter - MIT Press
In the near future every programmer will need to understand parallelism, a powerful way to run programs fast. The authors of this straightforward tutorial provide the instruction that will transform ordinary programmers into parallel programmers.