Name
Abstract | ||
|---|---|---|
We propose an algorithm for solving region-to-region visibility problems on digital terrain models using data parallel machines. Since global communication is the bottleneck in this kind of algorithm, the algorithm we propose focuses on the reduction of global communication. The algorithm analyses a strip of the source region at a time and sweeps through the source strip by strip. At most four sweeps are needed for the analysis. By exploring the coherence properties in the processor structure, global communication is minimized and complexity is substantially improved. Furthermore, all global write operations are exclusive and concurrency in global read operations is minimized. Since the problem size is usually large, we also designed rules of decomposition to efficiently handle the cases where the required number of processors is greater than available. The algorithm has been implemented on a Connection Machine CM-2, and results or computational experiments are presented. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1002/cpe.4330050502 | CONCURRENCY-PRACTICE AND EXPERIENCE |
DocType | Volume | Issue |
Journal | 5 | 5 |
ISSN | Citations | PageRank |
1040-3108 | 7 | 1.41 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Y. Ansel Teng | 1 | 26 | 4.83 |
| Daniel Dementhon | 2 | 1327 | 139.94 |
| Larry S. Davis | 3 | 14201 | 2690.83 |