An introduction to parallel algorithms
Citations
1 citations
Cites background or methods from "An introduction to parallel algorit..."
...The detail of this model is referred to [8], [9]....
[...]
...Now, a close observation of the resulting tours as determined by the successor function of [8], [13] indicates that there are two Euler cycles for each pseudo-tree, and each cycle edge ( x, f( x ) ) and its buddy ( f( x ),x ) appear in different Euler cycles, while each tree edge ( y , f( y ) ) and its buddy ( f( y ),y ) appear in the same Euler cycle....
[...]
...Step 2: Construct an adjacency list of the modified graph and find the Euler tours in the pseudoforest by using the procedure in [8], [13]....
[...]
...16] = [ 2,3,4,1,1,2,3,4,1,2,3,4,8,6,8,6] ....
[...]
1 citations
Additional excerpts
...[61])....
[...]
1 citations
1 citations
1 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....
[...]