An introduction to parallel algorithms
Citations
1 citations
Cites methods from "An introduction to parallel algorit..."
...Brent’s scheduling theorem [17], [35] indicate that using a greedy offline scheduler with p cores, the running time is bounded between W/p and W/p+D....
[...]
1 citations
Cites methods from "An introduction to parallel algorit..."
...These include PRAM models (see [1]), CTA model (see [2]), the PCAM design process [3], methodologies for designing parallel and multi-threading applications [4], [5] and so on....
[...]
1 citations
1 citations
1 citations
Cites background from "An introduction to parallel algorit..."
...; (12) see, e.g., [ 8 ]; † on Stage 2, compute the values V (i) in time...
[...]
...If we have a potentially unlimited number of processors, then we can do the following (see, e.g., [ 8 ], for the information on how to parallelize the corresponding stages):...
[...]
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....
[...]