Lectures in Parallel Computation

The foundations of parallel computation are the concern of this book, which may also function as a source of teaching material or reference for researchers.

Alan Gibbons (Edited by), Paul Spirakis (Edited by)

9780521017602, Cambridge University Press

Paperback, published 21 July 2005

448 pages
24.3 x 17 x 2.4 cm, 0.705 kg

"...of most interest to advanced computer scientists (for whom it could be a very good reference)..could be used for self-instruction, or as a text-book for an advanced graduate course...a must for theoretical computer scientists whose interests are in the foundations of parallel computing." IEEE Parallel & Distributed Technology

The foundations of parallel computation, especially the efficiency of computation, are the concern of this book. Distinguished international researchers have contributed fifteen chapters which together form a coherent stream taking the reader who has little prior knowledge of the field to a position of being familiar with leading edge issues. The book may also function as a source of teaching material and reference for researchers. The first part is devoted to the Parallel Random Access Machine (P-RAM) model of parallel computation. The initial chapters justify and define the model, which is then used for the development of algorithm design in a variety of application areas such as deterministic algorithms, randomisation and algorithm resilience. The second part deals with distributed memory models of computation. The question of efficiently implementing P-RAM algorithms within these models is addressed as are the immensely interesting prospects for general purpose parallel computation.

1. Structural parallel algorithmics Uzi Vishkin
2. PRAM models and fundamental parallel algorithmic techniques: part I Paul G. Spirakis and Alan Gibbons
3. PRAM models and fundamental parallel algorithmic techniques: part II Paul G. Spirakis
4. Efficient parallel graph algorithms Vijaya Ramachandran
5. Some parallel geometric algorithms Colm O'Dunlaing
6. Parallel algorithms for string pattern matching Costas S. Iliopoulos
7. Design of parallel matrix algorithms D. J. Evans
8. Dependable parallel computing on unreliable parallel machines Z. M. Kedem, K. V. Palem, A. Raghunathan and P. G. Spirakis
9. P-completeness Jacobo Toran
10. Introduction to distributed memory models of parallel computation Alan Gibbons
11. Network orientation Gerard Tel
12. Special purpose parallel computing W. F. McColl
13. General purpose parallel computing W. F. McColl
14. Complexity models for all-purpose parallel computation Andrew Chin
15. Implementing sparse BLAS primitives on concurrent/vector processors H. A. G. Wijshoff.

Subject Areas: Parallel processing [UYFP], Algorithms & data structures [UMB]