|
USM LINKS Computer Science
WEB PAGES CMInfo
RESOURCES Math Resources |
SYMPOSIUM
MINISYMPOSIA
|
December 4-5, 1998
University of Southern Mississippi
Hattiesburg, Mississippi
An Efficient Object-Oriented Distributed Contouring Algorithm
John Monde
Spatial analysis is a fundamental operation in a GIS, since it provides methods to deduce a set of high level information from a digital terrain model. Contouring is representative of spatial operations used in GIS, and other spatial systems. Contouring is a computationally intensive task since large datasets have to be processed, even if the computational complexity of the contour algorithm is low. Parallel processing techniques, where one or many computational tasks are distributed across a number of processing elements, have been proposed as a method to process large datasets. We investigate the feasibility of using a distributive object oriented system to implement parallel processing techniques.
The algorithm considered in this paper is a derivative of the Marching Squares Contour algorithm for which a parallelization based on domain decomposition using an effective load balancing strategy is described. Also the use of heterogeneous resources is considered. A number of communication libraries are now available, which permit the development of machine independent and portable applications. In this application, the Distributed Component Object Model (DCOM) is used and its advantages are discussed.
To obtain more information about the meeting send e-mail to: fscc98@pax.st.usm.edu.