By Topic

Developing non-local iterative parallel algorithms for GIS on a workstation network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Clematis, A. ; Ist. per la Matematica Applicata, CNR, Genova, Italy ; Coda, A. ; Spagnuolo, M.

The use of parallel computing is gaining increasing popularity in geographic information systems applications. There exists a class of spatial analysis algorithms that are based on local computation and are single step, hence leading to simple and efficient parallel code. For another class of algorithms it is not possible to make any assumption about the locality of computation, for example when extracting complex or global terrain features, and a number of iteration may be necessary to satisfy a convergence criteria, giving rise to non-local iterative algorithms. An example is the algorithm to extract drainage basins from digital terrain models. Despite the increasing difficulties there is an interest in parallelising non-local iterative algorithms. In this paper we present and compare different approaches to the parallelisation of non-local iterative algorithms on a workstation network using the Linda model of parallel programming

Published in:

Parallel and Distributed Processing, 1998. PDP '98. Proceedings of the Sixth Euromicro Workshop on

Date of Conference:

21-23 Jan 1998