ACCU Home page ACCU Conference Page
Search Contact us ACCU at Flickr ACCU at GitHib ACCU at Facebook ACCU at Linked-in ACCU at Twitter Skip Navigation

Search in Book Reviews

The ACCU passes on review copies of computer books to its members for them to review. The result is a large, high quality collection of book reviews by programmers, for programmers. Currently there are 1949 reviews in the database and more every month.
Search is a simple string search in either book title or book author. The full text search is a search of the text of the review.
    View all alphabetically
Introduction to Parallel Algorithms
C Xavier&S S Iyengar
0 471 25182 8
Brian Bramer
parallel systems; algorithms
Appeared in:
Although sequential computer systems are becoming more powerful the problems faced in areas such as communications and multimedia systems are becoming more complex, e.g. real-time video compression/decompression, image manipulation, etc. Parallel systems are suited to such problems but the task of programming them in non-trivial. Many computing science courses now contain modules on parallel hardware and programming.

This book is in four parts. Part one lays the foundations starting with an overview of hardware such as pipelining, multiprocessing, etc., the classification of parallel systems (Flynn's, Erlangen, Duncan's, etc.) and models of parallel architectures (tree, hypercubes, network, etc.) then moving on the look at data structures (arrays, lists, graphs, etc.) and to consider suitable paradigms for parallel algorithms. Part two covers algorithms for graph models, part three array manipulation (searching and sorting) and part four parallel algorithms for numerical and computational methods (matrices, differentiation, integration and differential equations).

A text on a very specialised area of computing science. Worth considering as a set text for a module on parallel algorithms taken as part of a theoretical computing science course (a good mathematical foundation is assumed). Would enable workers starting a research programme in this area to gain a good foundation before moving on to a specialised topic. Note that the programming of algorithms is not covered.