An introduction to parallel algorithms
Citations
11 citations
11 citations
Cites background from "An introduction to parallel algorit..."
...Topological sort has many applications in various job scheduling, network analysis, and other areas [1, 4]....
[...]
...The topological sort of an acyclic graph is to find a linear ordering for the vertices of the graph, such that if i j is an edge of the graph, then i appears before j in the ordering [4]....
[...]
11 citations
11 citations
Cites background or methods from "An introduction to parallel algorit..."
...Several techniques for PRAM fast string search have been proposed (e.g., see [1], [3], [16], [ 19 ], and [25])....
[...]
...We now study the problem of searching for one pattern string X in the text T [1; n]. Various CRCW PRAM parallel solutions are known (e.g., see [3], [16], and [ 19 ]), but not one that accounts for communication cost....
[...]
11 citations
Cites methods from "An introduction to parallel algorit..."
...al [14] and the scan primitive [15] can be used to preprocess a given tree to generate the required traversal of the tree [12]....
[...]
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....
[...]