An introduction to parallel algorithms
Citations
Cites background from "An introduction to parallel algorit..."
...Typical examples are the binary tree reconstruction problem [1] and the monotone polygon triangulation problem [6,8], which happen to have the same number of problem instances, the nth Catalan number, as of the parenthesis matching problem....
[...]
...Note that the prefix sum is a basic operation in parallel graph algorithms, parallel computational geometry, and a wide range of numerical calculations [6]....
[...]
Cites methods from "An introduction to parallel algorit..."
...Although having a generic CPU simulation framework is a worthy goal per se, the main motivation behind SMASim was to provide an exact software implementation of the moving threads architecture ( [10]) that is based on a virtual parallel random access machine (PRAM) [3, 5] model and differs from contemporary designs regarding the thread abstraction and handling....
[...]
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....
[...]