Name
Abstract | ||
|---|---|---|
Two parallel implementations of a 3D convex hull algorithm are reported. The paper considers a MIMD distributed memory architecture and the implementations are carried out on the Meiko Computing Surface using T800 transputers and the programming languages Occam and C. The first method uses a simple parallel geometric decomposition strategy and produces encouraging results. With the second approach a parallel generic Divide-and-Conquer kernel is incorporated. This is an example of the algorithmic skeleton approach to parallel programming and involves run-time, dynamic allocation of work to processors. The resulting performances for both methods are measured and compared. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1111/1467-8659.1310021 | COMPUTER GRAPHICS FORUM |
Keywords | Field | DocType |
COMPUTATIONAL GEOMETRY, PARALLELISM, CONVEX HULL | Kernel (linear algebra),Computer science,Computational geometry,Computer Aided Design,Parallel computing,Algorithmic skeleton,Convex hull,occam,Theoretical computer science,Parallel programming model,MIMD | Journal |
Volume | Issue | ISSN |
13 | 1 | 0167-7055 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. R. Clare | 1 | 1 | 0.71 |
| A. M. Day | 2 | 38 | 6.72 |