An introduction to parallel algorithms
Citations
215 citations
Cites methods from "An introduction to parallel algorit..."
...…a parallel machine can compute certain computations faster than a serial Turing machine, the difference in speed between the two machine models is never more than a polynomial amount of time, and, hence, negligible for non-polynomial time computations (see, e.g., Jaja, 1992; van Emde Boas, 1990)....
[...]
210 citations
Cites methods from "An introduction to parallel algorit..."
...Once S has been computed, the set S of ancestors of S in the shortest-path tree can also be computed by n processors in O(log n) time using tree contraction techniques [14]....
[...]
...Once J has been computed, S can be computed by n processors in O(log n) times on a CREW PRAM using standard techniques [14]....
[...]
...) Each of these computations can be done by n processors in O(log n) time on a CREW PRAM using standard techniques [14]....
[...]
...The model of computation we use is the Concurrent-Read, Exclusive-Write Parallel RAM, in which independent, synchronized parallel processors share a common memory [14]....
[...]
207 citations
201 citations
199 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....
[...]