An introduction to parallel algorithms
Citations
85 citations
Cites background or methods from "An introduction to parallel algorit..."
...We apply the approach in [ 21 ] which uses Euler tour and range-minimum calculation....
[...]
...We now consider Operation 3. Given an Euler tour of vertices a1; a2;:::;an; a1. The element ai D v is the leftmost (rightmost) appearance of v if and only if level(aii1 )= level(v )-1( level(aiC1 )= level(v) - 1, respectively) [ 21 ]....
[...]
84 citations
84 citations
84 citations
Cites background or methods from "An introduction to parallel algorit..."
...It consists in emulating aq(p)-PRAM on the distributed architecture,q(p) being larger enough compared top....
[...]
...We consider a PRAM [6, 10] with a bounded number p of processors; this allows us to eliminate communication overheads....
[...]
...Such a schedule leads to nearly times optimal executions, including scheduling overheads, on theoretical machine models such as the PRAM....
[...]
...From here, the distributed machine is assumed to emulate aq(p)-PRAM with delayh(p)....
[...]
...T1 is then a lower bound of the minimal time required by any non-preemptive schedule on an unbounded number of processors ignoring communications times (PRAM model [6])....
[...]
84 citations
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....
[...]