An introduction to parallel algorithms
Citations
25 citations
Cites methods from "An introduction to parallel algorit..."
...To evaluate the expression of hv.w/ for each supernode, Sollin’s algorithm, as implemented in say [ 22 ], uses a rake-and-compress algorithm [23]....
[...]
...FNRP uses a parallel prefix update algorithm [ 22 ] to determine rep kC1 .v 0 / and to update that value to all processors involved in the computation....
[...]
...O.log n/ iterations using n 2 processors on a CREW PRAM [ 22 ]....
[...]
...In total, for all supernodes in iteration k, this parallel prefix update algorithm takes O.log n/ time using n processors on a CREW PRAM [ 22 ]....
[...]
25 citations
25 citations
25 citations
25 citations
Cites background from "An introduction to parallel algorit..."
...The interested reader can refer to [1], [2], [17] for further discussion on the massively parallel processing models, architectures, and algorithms....
[...]
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....
[...]