An introduction to parallel algorithms
Citations
1 citations
Cites background or methods from "An introduction to parallel algorit..."
...best known sequential bound for multiplying two nxn matrices, according to [17] [pages 249-250]....
[...]
...Step 13 requires O(log n) time using O(n log n) operations on CRCW PRAM, or in O(log n) time using O(M(n)*log n) operations on CREW PRAM, where M(n) is the best known sequential bound for multiplying two nxn matrices, according to [17] [pages 249-250]....
[...]
...A detailed discussion of Parallel Computer Models can be found in [15-17] and is beyond the scope of this paper....
[...]
1 citations
1 citations
1 citations
Cites methods from "An introduction to parallel algorit..."
...This can be done in timeO(logN) by employing a parallel sorting or selection algorithm (see [8])....
[...]
...This assumption is satisfied by the idealized PRAM model [8], which can be simulated on many realistic architectures with at most logarithmic slowdown....
[...]
...The values of m andh can be determined and broadcast to all processors in steps (d) and (e) by simple prefix computations (see [8]) in time O(logN)....
[...]
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....
[...]