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 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 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.