F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar. A randomized parallel 3D convex hull algorithm for coarse grained multicomputers. In Proc. ACM Symposium on Parallel Algorithms and Architectures, pages 27--33, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
DOI: 10.1007/s00453-002-1009-y - Algorithmica Algorithmica.. Self-citation (Dehne Parallel) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar. A randomized parallel 3D convex hull algorithm for coarse grained multicomputers. In Proc. ACM Symposium on Parallel Algorithms and Architectures, pages 27--33, 1995.
DOI: 10.1007/s00453-001-0109-4 - Algorithmica Algorithmica.. 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 Multicomputers, Proc. ACM Symposium on Parallel Algorithms and Architectures, 1995, pp. 27--33.
Reducing I/O Complexity by Simulating - Coarse Grained Parallel Self-citation (Dehne Parallel) (Correct)
No context found.
DEHNE,F.,DENG,X.,DYMOND,P.,FABRI,A., AND KHOKHAR, A. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. In Proc. ACM Symp. on Parallel Algorithms and Architectures (1995), pp. 27--33.
Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003) (13 citations) Self-citation (Dehne Parallel) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar. A randomized parallel 3D convex hull algorithm for coarse grained multicomputers. In Proc. ACM Symposium on Parallel Algorithms and Architectures, pages 27--33, 1995.
Reducing I/O Complexity by Simulating Coarse.. - Dehne, Hutchinson, .. (1999) Self-citation (Dehne Parallel) (Correct)
No context found.
DEHNE,F.,DENG,X.,DYMOND,P.,FABRI,A., AND KHOKHAR, A. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. In Proc. ACM Symp. on Parallel Algorithms and Architectures (1995), pp. 27--33.
Efficient Parallel Graph Algorithms for Coarse-Grained .. - Dehne, Ferreira.. (2002) (18 citations) 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 Multicomputers, Proc. ACM Symposium on Parallel Algorithms and Architectures, 1995, pp. 27--33.
Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003) (13 citations) Self-citation (Dehne Parallel) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar. A randomized parallel 3D convex hull algorithm for coarse grained multicomputers. In Proc. ACM Symposium on Parallel Algorithms and Architectures, pages 27--33, 1995.
Efficient Parallel Graph Algorithms for Coarse-Grained.. - Dehne, Ferreira, E. (2002) (18 citations) 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 Multicomputers, Proc. ACM Symposium on Parallel Algorithms and Architectures, 1995, pp. 27--33.
Reducing I/O Complexity by Simulating Coarse.. - Dehne, Hutchinson, .. (1999) Self-citation (Dehne Parallel) (Correct)
No context found.
DEHNE,F.,DENG,X.,DYMOND,P.,FABRI,A., AND KHOKHAR, A. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. In Proc. ACM Symp. on Parallel Algorithms and Architectures (1995), pp. 27--33.
Coarse Grained Parallel Computing on Heterogeneous Systems - Morin (1998) (5 citations) Self-citation (Parallel) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Kokhar. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. In Proceedings of ACM Symposium on Parallel Algorithms and Architectures, pages 27--33, 1995.
Bulk Synchronous Parallel Algorithms for the.. - Dehne, Dittrich.. (2002) (2 citations) Self-citation (Dehne Parallel) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. In Proc. ACM Symp. on Parallel Algorithms and Architectures, pages 27--33, 1995.
Reducing I/O Complexity by Simulating Coarse.. - Dehne.. (1999) Self-citation (Dehne Parallel) (Correct)
No context found.
DEHNE,F.,DENG,X.,DYMOND,P.,FABRI,A., AND KHOKHAR, A. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. In Proc. ACM Symp. on Parallel Algorithms and Architectures (1995), pp. 27--33.
Efficient Parallel Graph Algorithms for.. - Dehne, Ferreira.. (2002) (18 citations) 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 Multicomputers, Proc. ACM Symposium on Parallel Algorithms and Architectures, 1995, pp. 27--33.
Parallel Computation On Interval Graphs: Algorithms And .. - Ferreira, Lassous.. (2002) Self-citation (Parallel) (Correct)
No context found.
Dehne F, Deng X, Dymond P, Fabri A, Khokhar A. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. Proceedings of the 7th ACM Symposium on Parallel Algorithms and Architectures, ACM Press: New York, 1995; 27--33.
Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003) (13 citations) Self-citation (Dehne Parallel) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar. A randomized parallel 3D convex hull algorithm for coarse grained multicomputers. In Proc. ACM Symposium on Parallel Algorithms and Architectures, pages 27--33, 1995.
ParLeda: A Library for Parallel Processing in Computational .. - Ghodsi, Sharifzadeh Self-citation (Parallel) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar, \A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers," 1993.
Parallel Range Minima on Coarse Grained Multicomputers - Mongelli, Song (1999) Self-citation (Parallel) (Correct)
....round between processors. In a communication round, each processor can send and receive O(n=p) data. This is a more realistic model than the PRAM model for most real parallel computers. The number of communication rounds is an important issue in the design of algorithms. It has been introduced in [7, 8, 9], where algorithms using a constant Supported by FAPESP (Funda c ao de Amparo a Pesquisa do Estado de S ao Paulo) Proc. No. 98 06138 2, CNPq Proc. No. 52 3778 96 1, CNPq NSF Collaborative Research Program Proc. No. 680037 99 3, and CAPES PICDT. number of communication rounds were presented for ....
....new, complete experimental results, including time and speedup curves. 2. Preliminaries In this section we describe the parallel computing model and some de nitions used in the design of the proposed algorithm. 2.1. CGM (Coarse Grained Multicomputer) Model The CGM model was proposed by Dehne [7, 8, 9]. It is similar to the BSP (bulk synchronous parallel) model [19] However, it uses only two parameters: the input size n and the number of processors p. Each processor has a local memory of size O(n=p) The term coarse grained means the size of the local memory is much larger than O(1) Dehne et ....
[Article contains additional citation context not shown here]
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. A. Kokhar, \A randomized parallel 3d convex hull algorithm for coarse grained multicomputers," Proc. ACM Symposium on Parallel Algorithms and Architectures (SPAA'95), 1995, pp. 27-33.
Scaleable Parallel Algorithms for Lower Envelopes with.. - Boxer, Miller.. (1998) Self-citation (Parallel) (Correct)
....TMC CM 5 have local memories 32 Mbytes. For a more detailed description of the 3 model and its associated operations, see [DFR93] Recently, there has been a growing interest in coarse grained computational models [Vali90, CKPSSSSE, H K93] and the design of coarse grained geometric algorithms [DFR93, FRU95, DDDFK95]. The work on computational models has tended to be motivated by the observation that fast algorithms for ne grained models rarely translate into fast code running on coarse grained machines. The BSP model, described by Valiant [Vali90] uses slackness in the number of processors and memory ....
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar, A randomized parallel 3D convex hull algorithm for coarse grained multicomputers, Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, (1995), 27-33. 33
Reducing I/O Complexity by Simulating Coarse.. - Dehne, Dittrich.. (1999) Self-citation (Dehne Parallel) (Correct)
....) O( N log v pDB ) 2. Batched planar point location O( N B k) logM B N B ) 7] O( N log N v ) O(1) M = O( N log v v ) O( N log v pDB ) 3. 3D convex hull, 2D Voronoi diagram, Delaunay triangulation e O( N B logM B N B ) 25] O( N log N v ) [16] = O(1) M = O( N v ) O( N pDB ) 4. Lower envelope of nonintersecting line segments = O( NlogN v ) 19] O(1) M = O( N B ) O( N pDB ) 5. Generalized lower envelope of line segments = O( NlogN v ) 19] O(1) M = O( Nff(N) B ) O( Nff(N) pDB ) 6. ....
Dehne, F., Deng, X., Dymond, P., Fabri, A., and Khokhar, A. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. In Proc. ACM Symp. on Parallel Algorithms and Architectures (1995), pp. 27--33.
Reducing I/O Complexity by Simulating Coarse.. - Dehne.. (1999) Self-citation (Dehne Parallel) (Correct)
No context found.
DEHNE, F., DENG, X., DYMOND, P., FABRI, A., AND KHOKHAR, A. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. In Proc. ACM Symp. on Parallel Algorithms and Architectures (1995), pp. 27--33.
I/O-Efficient Construction of Voronoi Diagrams - Kumar, Ramos (2002) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri and A. Khokbar. A randomized parallel 3D convex hull algorithm for coarse grained multicomputers. In Proc. ACM Sympos. Parallel Algorithms Architectures (SPAA 95), 27--33, 1995.
A Coarse-Grained Multicomputer Algorithm for the Longest.. - Garcia, Myoupo, Seme (2003) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri and A. Khokhar, A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers, Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, (1995) 27-33.
A Coarse-Grained Multicomputer Algorithm for the Longest.. - Garcia, Myoupo, Seme (2003) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri and A. Khokhar, A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers, Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, (1995) 27-33.
A Coarse-Grained Multicomputer Algorithm for the Longest.. - Garcia, Seme (2003) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pages 27--33, 1995.
A Coarse-Grained Multicomputer Algorithm for the Longest.. - Garcia, Seme (2003) (Correct)
No context found.
F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pages 27--33, 1995.
First 50 documents
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