An introduction to parallel algorithms
Citations
32 citations
32 citations
Cites background from "An introduction to parallel algorit..."
...Note that in work-depth models, we do not concern ourselves with how processors are mapped to tasks (see for example, Jaja [43] or Blelloch et al....
[...]
32 citations
31 citations
31 citations
Cites background or methods from "An introduction to parallel algorit..."
..., n− 1] [388] to group all the nodes, and then (2) sorting the nodes within each group using a parallel comparison sort [243]....
[...]
...They can also be analyzed in the Work-Time Framework [243], in which the total number of operations W and number of parallel time steps T is specified....
[...]
...As with list contraction, parallel algorithms for tree contraction have received considerable interest [335, 243, 395]....
[...]
...Algorithms are analyzed using the Work-Time Framework [243], where work is the same as in the work-depth model and time is equivalent to depth in the work-depth model....
[...]
...The main goal in developing efficient parallel algorithms is to have an algorithm with low (polylogarithmic) depth and work matching that of the best 5This contrasts with the Work-Time Framework, which is a framework for analyzing PRAM algorithms and does not allow for nested parallelism....
[...]
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....
[...]