An introduction to parallel algorithms
Citations
1 citations
1 citations
Cites background or methods from "An introduction to parallel algorit..."
...It is well-known that the range-minima problem on a sequence of n elements can be solved in O(logn) time using n / logn processors on the EREW PRAM model [7, 11]....
[...]
...3: The matrices D and DD of = [8, 3, 2, 7, 1, 9, 6, 5, 4]....
[...]
...Let us now show step-by-step the computation of the D-domination set of an element of the permutation = [8, 3, 2, 7, 1, 9, 6, 5, 4] using the algorithm D-domination; we choose the element 1....
[...]
...1: A permutation = [8, 3, 2, 7, 1, 9, 6, 5, 4], and its corresponding permutation graph G[]....
[...]
...This computation goes as follows: Steps 1 & 2: Y1 ← D1 = [s, 8, 3, 2, 7]; Step 3: Y1 ← [2, 2, 2, 2, 7]; Step 4: DD1 ← [2, 2, 2, 2, 7]; Step 5: DD1 ← [0, 0, 0, 2, 7]; Step 6: DD1 ← [2, 7]....
[...]
1 citations
1 citations
1 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....
[...]