# An introduction to parallel algorithms

TL;DR: This book provides an introduction to the design and analysis of parallel algorithms, with the emphasis on the application of the PRAM model of parallel computation, with all its variants, to algorithm analysis.

Abstract: Written by an authority in the field, this book provides an introduction to the design and analysis of parallel algorithms. The emphasis is on the application of the PRAM (parallel random access machine) model of parallel computation, with all its variants, to algorithm analysis. Special attention is given to the selection of relevant data structures and to algorithm design principles that have proved to be useful. Features *Uses PRAM (parallel random access machine) as the model for parallel computation. *Covers all essential classes of parallel algorithms. *Rich exercise sets. *Written by a highly respected author within the field. 0201548569B04062001

...read more

##### Citations

672 citations

530 citations

### Cites background from "An introduction to parallel algorit..."

...Finally, it is easy to forget that parallel graph algorithms have been studied by computer scientists for several decades, particular in the PRAM model [77, 60]....

[...]

...The most prevalent model in theoretical computer science, which dates back several decades, is the PRAM [77, 60]....

[...]

528 citations

525 citations

### Cites background from "An introduction to parallel algorit..."

...JáJá’s book An Introduction to Parallel Algorithms devotes a chapter to discussing parallel models and then extensively delves into parallel algorithms [172]....

[...]

465 citations

### Cites methods from "An introduction to parallel algorit..."

...same location are resolved in different ways as is done is the varieties of PRAM models, such as by using a reduction operation [14]....

[...]

##### References

2,870 citations

### "An introduction to parallel algorit..." refers background in this paper

...Multiprocessorbased computers have been around for decades and various types of computer architectures [2] have been implemented in hardware throughout the years with different types of advantages/performance gains depending on the application....

[...]

...Every location in the array represents a node of the tree: T [1] is the root, with children at T [2] and T [3]....

[...]

...The text by [2] is a good start as it contains a comprehensive description of algorithms and different architecture topologies for the network model (tree, hypercube, mesh, and butterfly)....

[...]

1,407 citations

### "An introduction to parallel algorit..." refers background in this paper

...Parallel architectures have been described in several books (see, for example, [18, 29])....

[...]

969 citations

### "An introduction to parallel algorit..." refers background in this paper

...Recent work on the mapping of PRAM algorithms on bounded-degree networks is described in [3,13,14, 20, 25], Our presentation on the communication complexity of the matrix-multiplication problem in the sharedmemory model is taken from [1], Data-parallel algorithms are described in [15]....

[...]

942 citations

### "An introduction to parallel algorit..." refers background in this paper

...Rigorous descriptions of shared-memory models were introduced later in [11,12]....

[...]

839 citations

### "An introduction to parallel algorit..." refers methods in this paper

...The WT scheduling principle is derived from a theorem in [7], In the literature, this principle is commonly referred to as Brent's theorem or Brent's scheduling principle....

[...]