An introduction to parallel algorithms
Citations
50 citations
50 citations
Cites methods from "An introduction to parallel algorit..."
...We use the work-depth model [13] allowing for concurrent reads and writes, where work W is equal to the number of operations required (equivalently, the product of the time and the number of processors) and depth (span) D is equal to the number of time steps required....
[...]
50 citations
50 citations
Cites background or methods from "An introduction to parallel algorit..."
...For the image example in Fig. 1a, the subimages of labels o after the local watershed are illustrated in Fig. 5. The BCG for every processor in 8-connectivity is bcg0= [[2, 5], [0, 5], [1, 8], [0, 9], [0, 7], [0, 11], [4, 6]], bcg1=[ [6, 4], [5, 2], [5, 0], [5, 12], [6, 13]], bcg2=[[9, 0], [ 7 , 0], [10, 13], [8, 1]], bcg3=[[11, 0], [12, 5], [13, 6], [13, 10]]....
[...]
...For the same reason, vertices [5, 6], [ 7 , 8, 9, 10], and [11, 12, 13] are unsolved in the processors they belong to....
[...]
...Several parallel implementations of the Boru# vka algorithm exist in the literature [5, 7 , 9, 21], but for our problem, we need a constrained parallel MSF operator....
[...]
...For the image example in Fig. 1a, the subimages of labels o after the local watershed are illustrated in Fig. 5. The BCG for every processor in 8-connectivity is bcg0= [[2, 5], [0, 5], [1, 8], [0, 9], [0, 7 ], [0, 11], [4, 6]], bcg1=[ [6, 4], [5, 2], [5, 0], [5, 12], [6, 13]], bcg2=[[9, 0], [7, 0], [10, 13], [8, 1]], bcg3=[[11, 0], [12, 5], [13, 6], [13, 10]]....
[...]
49 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....
[...]