F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. A. Kokhar, A randomized parallel 3D convex hull algorithm for coarse-grained parallel multicomputers, in Proc. ACM Symp. on Parallel Algorithms and Architectures, 1995," pp. 27#33. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
d-Dimensional Range Search on Multicomputers - Ferreira, Kenyon, Rau-Chaplin, .. (1996) (Correct)
.... are clearly additional to the ones in the definition [21] In this paper, we use the Coarse Grained Multicomputer model (CGM(s; p) also sometimes referred to as the weak CREW BSP model[15] This model has been used (explicitly or implicitly) in parallel algorithm design for variety of problems [12, 15, 8, 11, 17, 9, 14] and has led to parallel codes exhibiting good timing results [12, 9, 14] It consists of a set of p processors P 0 to P p Gamma1 with O( s p ) local memory each, connected via some arbitrary interconnection network or a shared memory. The term coarse grained refers to the fact that the size ....
....is said to be in dimension i if the segments associated to its leaves are obtained by a projection of a subset of L onto dimension i. Definition 1 The j dimensional range tree T for a set L j is recursively defined as follows. 6 [3,4) 4,5) 5,6) 6,7) 7,8) 8,8) 2,3) 1,2) 3,5) 1,3) 5,7) [7,8] [5,8] 1,5) 1,8] Figure 1: The segment tree structure for (1,8) i A primary segment tree T in dimension d Gamma j 1 corresponding to the set fx d Gammaj 1 (l)jl 2 L j g. For each node v of T , let W (v) denote the set of points such that x d Gammaj 1 (l) lies in the interval ....
[Article contains additional citation context not shown here]
F. Dehne, X. Deng., P. Dymond, and A.A. Khokar. A randomized parallel 3D convex hull algorithm for coarse grained parallel multicomputers. In Proc. of the ACM Sympoisum on Parallel Algorithms and Architectures, july 16-18, Santa Barbara, USA, 1995.
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) Self-citation (Dehne Parallel) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. A. Kokhar, A randomized parallel 3D convex hull algorithm for coarse-grained parallel multicomputers, in Proc. ACM Symp. on Parallel Algorithms and Architectures, 1995," pp. 27#33.
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) Self-citation (Dehne Parallel) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. A. Kokhar, A randomized parallel 3D convex hull algorithm for coarse-grained parallel multicomputers, in Proc. ACM Symp. on Parallel Algorithms and Architectures, 1995," pp. 27#33.
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) Self-citation (Dehne Parallel) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. A. Kokhar, A randomized parallel 3D convex hull algorithm for coarse-grained parallel multicomputers, in Proc. ACM Symp. on Parallel Algorithms and Architectures, 1995," pp. 27#33.
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) Self-citation (Dehne Parallel) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. A. Kokhar, A randomized parallel 3D convex hull algorithm for coarse-grained parallel multicomputers, in Proc. ACM Symp. on Parallel Algorithms and Architectures, 1995," pp. 27#33.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC