by Henri Casanova, et al.
Publisher: CRC Press 2008
Number of pages: 348
The aim of this book is to provide 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, and fundamental notions of scheduling. The focus is on algorithms for distributed-memory parallel architectures in which computing elements communicate by exchanging messages.
Home page url
Download or read it online for free here:
by G.C. Fox, R.D. Williams, P.C. Messina - Morgan Kaufmann Publishers
A clear illustration of how parallel computers can be successfully applied to large-scale scientific computations. The book demonstrates how various applications in physics, biology and other sciences were implemented on real parallel computers.
by Sabu M. Thampi - arXiv
An overview of distributed computing systems. The definition, architecture, characteristics of distributed systems and the various fallacies are discussed. Finally, discusses client/server computing, World Wide Web and types of distributed systems.
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 Ian Parberry - Prentice Hall
The rapid growth of parallel complexity theory has led to a proliferation of parallel machine models. This book presents a unified theory of parallel computation based on a network model. It is the first such synthesis in book form.