×

Introduction to parallel algorithms. (English) Zbl 0948.68220

Chichester: Wiley. xvi, 365 p. (1998).
This book is an introductory text to parallel algorithms. It presents in an elementary manner principal concepts and fundamental algorithms of parallel computing. In the first part (Foundations of Parallel Computing) the authors describe models for parallel computing, data structures used in parallel computing and paradigms for parallel algorithms. It closes with pointing out some simple algorithms. The second part is devoted to algorithms for graph models. It starts with tree algorithms, then discusses simple algorithms for arbitrary graphs such as connectivity problems and spanning trees and closes with so-called NC algorithms for the subclass of chordal graphs. In Part 3 searching and sorting algorithms are considered whereas the last part (Part 4) deals with numerical algorithms. Here first algebraic equations and matrix manipulations are considered and the the authors turn to differentiation, integration, interpolation and the solution of differential equations. The book is written on an elementary level. Before proceeding to parallel algorithms the authors explain the most common sequential variant in order to give a feeling for the solution of the algorithmic problem. In the course of developing parallel algorithms, in several cases, it is discussed which level of parallelism is required to implement this variant is included. This latter does not only concern the number of processors but also their capability to read/write to memory locations.

MSC:

68W10 Parallel algorithms in computer science
68Q05 Models of computation (Turing machines, etc.) (MSC2010)
68-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
PDFBibTeX XMLCite