An introduction to parallel algorithms
Citations
9 citations
Cites methods from "An introduction to parallel algorit..."
...Many parallel algorithms for selection have been designed for the PRAM model [2, 3, 4, 9, 14] and for various network models including trees, meshes, hypercubes and recon gurable architectures [6, 7, 13, 16, 21]....
[...]
9 citations
Cites background or methods from "An introduction to parallel algorit..."
...Scan can be done in O(n) work and O(log n) span (assuming ⊕ takes O(1) work) [17] on the CRCW PRAM, O(log(n)) span in the binary forking model....
[...]
...The parallel random access machine (PRAM) model is a classic parallel model with p processors that work in lock-step, connected by a parallel shared-memory [17]....
[...]
...Filter can both be done in O(n) work and O(log n) span on the CRCW PRAM (assuming f takes O(1) work) [17], O(log(n)) span in the binary forking model....
[...]
9 citations
Additional excerpts
..., in textbooks [22, 23])....
[...]
8 citations
8 citations
References
2,895 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,410 citations
"An introduction to parallel algorit..." refers background in this paper
...Parallel architectures have been described in several books (see, for example, [18, 29])....
[...]
1,000 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]....
[...]
951 citations
"An introduction to parallel algorit..." refers background in this paper
...Rigorous descriptions of shared-memory models were introduced later in [11,12]....
[...]
864 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....
[...]