An introduction to parallel algorithms
Citations
Cites background from "An introduction to parallel algorit..."
...In [11] it is shown that computing the all-pairs-shortest-path matrix can be done by a fast-parallel algorithm....
[...]
...All of them are explained in greater detail in [11]....
[...]
Cites background or methods from "An introduction to parallel algorit..."
...Concurrent writes are resolved using one of the resolution rule such as Common, Collision, Collision +, Arbitrary and Priority [5]....
[...]
...We first modify the famous pointer jumping [5] technique and call the new procedure, MPJ_procedure....
[...]
...Also each step of a CRCW SRMBM(P,B) can be simulated in O(1) time on a Priority CRCW PRAM(O(P2B),O(PB))....
[...]
...• Modified Pointer Jumping (MPJ_procedue): The pointer jumping technique [5] originally, in each iteration, doubles the path between a node and its parent in a list....
[...]
...On concurrent read exclusive write (CREW) PRAM, list ranking problem can be solved using pointer jumping technique in O(log N) [5]....
[...]
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....
[...]