An introduction to parallel algorithms
Citations
5 citations
5 citations
5 citations
5 citations
5 citations
Cites background or methods from "An introduction to parallel algorit..."
...In phase (2), E[li; li+1] (1 i m) can be found by computing the intersection of Ej and li for any i and j (one should make k copies of lines l1, l2, : : :, lm+1 to avoid concurrent reading), and then for every j compute the intersections of Ej with l1, l2, : : :, lm+1 by merging the endpoints of the segments of Uj with l1, l2, : : :, lm+1 by their x-coordinates, in O(logn) time using O(n= logn) processors [15]....
[...]
...The prefix maxima computation of Y (P ) can be done in O(logn) time usingO(n= logn) processors[15]....
[...]
...We first sort S in increasing slope and sort P (S) in increasing x-coordinate in O(logn) time using O(n) processors in the EREW PRAM [15]....
[...]
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....
[...]