An introduction to parallel algorithms
Citations
1 citations
Cites background from "An introduction to parallel algorit..."
...Proof of the following Lemma can be found in relevant texts (such as [56, 51])....
[...]
...A Parallel Random Access Machine (PRAM) is a collection of RAMs working in synchrony where communication takes place with the help of a common block of shared memory [56, 51]....
[...]
..., [56, 51]), Step 2 can also be completed in O(log n) time using n logn processors....
[...]
1 citations
Cites methods from "An introduction to parallel algorit..."
...Due to the lack of space, we cannot detail the basic parallel techniques used in this section (Prefix sum, Pointer Jumping and Parallel Tree Contraction), so we refer the reader to the classical book by Jájá [16]....
[...]
...Due to the lack of space, we cannot detail the basic parallel techniques used in this section (Prefix sum, Pointer Jumping and Parallel Tree Contraction), so we refer the reader to the classical book by Jájá [16]....
[...]
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....
[...]