An introduction to parallel algorithms
Citations
6 citations
Cites methods from "An introduction to parallel algorit..."
...We denote the model by PRAM(p,M)....
[...]
...1 PRAM Model Parallel random access machine (PRAM) model [2, 3, 4] has p processors that can execute arbitrary instructions with a constant number of operands simultaneously....
[...]
...We simulate the EREW PRAM model by AGPU(p, p,M), that is, all the p cores belong to a single multiprocessor, and they use the same shared memory....
[...]
...Parallel random access machine (PRAM) model [2, 3, 4] has p processors that can execute arbitrary instructions with a constant number of operands simultaneously....
[...]
...Then it holds that AGPU(p, p,M) ≤ O(Mp )PRAM(p,M)....
[...]
6 citations
Cites background or methods from "An introduction to parallel algorit..."
...Since there are O ((f (i + 1))2) vertical linesLs and since the size of the vertex sequence for each groupGj is also O((f (i + 1))2), one can compute the intersections between all such vertical lines and the boundary of eachI (Gj) by a parallel merge [20] instead of binary searches....
[...]
...This can be done by performing O(1) parallel prefix operations [13,20,23]....
[...]
...If |S(i+1)| n/ logn, then use Cole’s merge sort [10] to sort the elements in S(i+1), and use parallel prefix [20] on the weights of these sorted elements to find the sought element ak from S(i + 1)....
[...]
6 citations
Cites methods from "An introduction to parallel algorit..."
...Also, we will assume a standard theoretical PRAM (CREW) model for the formal analysis [22]....
[...]
6 citations
6 citations
Cites background from "An introduction to parallel algorit..."
...The reader is referred to [1,6,12] for those terms not defined here....
[...]
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....
[...]