Parallel GRASS

[Sastry V. Dhara]

We are trying to rewirite parts of GRASS code to be run
on Parallel Machines.

We are trying to identify those functions that are 
compuatationally intensive.

The functions we identified so far are:

r.mapcalc and r.buffer

Can you suggest any other functions that take a lot of
CPU time ?

Also, I request those who are already doing this kind of
work to share their experiences here.

Or, you can send me mail directly.

Thanks.

Sastry Dhara
Northeast Parallel Architectures Center
Syracuse University
Syracuse, NY 13244

svdhara at npac.syr.edu




----- End Included Message -----


How about r.watershed, r.neighbor, and r.report?


Srinivasan