Parallel Modeling and Analysis of Hydrologic Flow Routing Algorithms
|
 |
|
Post a Comment
|
|
|
|
|
|
ABSTRACT:
The function of a flow algorithm 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 any flow routing 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 flow routing algorithms used in GIS. Presented also are comparisons of these algorithms based on performance metrics such as parallel speed up, parallel efficiency, parallel cost, and cost-optimal and scalability functions, while these algorithms are running under the PRAM model.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
0
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
2/81
|
|
|
|
|
|
|
| Prev |
Next |
|