No label defined (Q4023834)

The textbook consisting of Preface, six Chapters, three Appendices, Bibliography, and Index introduces the fundamental concepts of parallel computing emphasizing algorithmic and complexity aspects. Chapters 1 (Introduction) and 2 (Preliminaries) introduce concepts of computability, sequential computing models, formal statement of the problem, its complexity analysis and structuring in classes of complexity. Chapter 3 (Parallel Computation Models) explains the thesis of parallel computation, defines parallel computation and analyzes formal models such as Boolean circuits, parallel RAM (PRAM) models, structured models and distributed system models. Chapter 4 (Parallel Algorithms) starts with some basic computational techniques for sequential algorithms enabling to identify their independent steps to obtain finally a parallel version. The performance of arithmetic, combinatorial and numerical algorithms is evaluated with respect to different models. Chapter 5 (Parallel Architectures) describes the main architectural characteristics of parallel machines, a classification scheme centred on a programmer's point of view and interconnection structures to connect processing elements. Chapter 6 (VLSI Algorithms and Architectures) describes computing models and criteria such as the VLSI complexity well suited to evaluate VLSI performance. Appendices describe orders of magnitude, number representation and Pidgin ALGOL language. The book is a well readable text presenting systematically fundamentally fundamentals of parallel computation. The subject is presented not only by using rigorous definitions, theorems and propositions supplied with proofs, but also algorithms, programs and numerous motivating examples taking advantages of their instructional value. End-of-chapter bibliographical notes and unsolved problems for readers are supplied. A complete and up-to-date bibliography is included.