An introduction to parallel algorithms
Citations
2 citations
2 citations
2 citations
2 citations
Cites background or methods from "An introduction to parallel algorit..."
...The ranks and the size of the list are computed and broadcast to all the elements of the list by the procedure of pointer jumping (see [25])....
[...]
...There is an algorithm for this problem that runs in time O(log(3) n) on an EREW PRAM with n processors (see [25] and the references therein)....
[...]
...The PRAM model has variants categorized according to the semantics of concurrent access of processors to the shared memory ([25])....
[...]
2 citations
Cites background or methods from "An introduction to parallel algorit..."
...It can be solved in O(loglogN) time using N 3 loglogN CRCW processors by applying Lemma 4 described in [10]....
[...]
...See [1], [10] for details....
[...]
...Lemma 1 [10] A single step execution of the N-processor CRCW can be simulated by an Nprocessor EREW in O(logN) time....
[...]
...A parallel algorithm is termed optimal or work-optimal [10] if the work W (n) required by this algorithm satisfies W (n) = Θ(T ∗(n)), where T ∗(n) is the running time of the fastest sequential algorithm for the problem....
[...]
...For each processor, we use the optimal sequential algorithm for finding the minimum (or maximum) described in [10]....
[...]
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....
[...]