An introduction to parallel algorithms
Citations
1 citations
1 citations
1 citations
Cites background or methods from "An introduction to parallel algorit..."
...P4-transitive orientation problems on P4-comparability graphs and analyze their time and processor complexity on the PRAM model of computation [2, 17 ,30]....
[...]
...(vi) It is well known that the sorting problem on n elements has an optimal solution which takes O(log n) time and requires O(n) processors on the EREW PRAM model [2, 17 ]....
[...]
...Recall that � m. 1. It is well known that n elements can be sorted in O(log n) time with O(n)processors on the EREW PRAM model [2, 17 ]....
[...]
...the best-known sequential bound for the multiplication of two (n × n)-size arrays [ 17 ]....
[...]
...1 i p .S incep 2m and n elements can be optimally sorted in O(log n) time with O(n) processors on the EREW PRAM model [2, 17 ], the whole step takes O(log m) time and uses O(m) processors on the EREW PRAM model....
[...]
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....
[...]