Parallel Implementation of the D8 Flow Routing Algorithm in a Geographic Information System
|
 |
|
Post a Comment
|
|
|
|
|
|
ABSTRACT:
The function of a flow algorithm in a Geographic Information System is to transfer flow of particles to lower adjacents points or areas in a landscape. The particles maybe sediment, detached soil particles, vegetation, nutrients, water, or a combination of these. The serial implementation of the D8 algoritm has a linear storage and running time that is a function of the number of grid cells contained in the digitized terrain. This means that as the number of grid cells is increased, the time and the computing memory required to compute the flow profile increase linearly. To obtain higher accuracy in computing the flow profile of a terrain, finer granularity of the grid cells is required. When profiling a greater-area terrain at higher resolution, the problem becomes memory-bound, and thus parallelization is necessary. This paper presents the analytical model of the parallel implementation of the D8 flow routing algorithm. Performance metrics such as parallel speed up, parallel efficiency, parallel cost, cost-optimal function, and scalability, under the Parallel Random Access Memory Model are presented. The implementation of the D8 algorithm on a hypercube parallel machine is also discussed.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
0
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
1/95
|
|
|
|
|
|
|
| Prev |
Next |
|