Proc. Third Int. Workshop on Parallel Algorithms for
Irregularly Structured Problems (IRREGULAR'96), pp. 119-130,
Santa Barbara, CA August 19-21, 1996.
Ömer Egecioglu and Ashok Srinivasan
Domain Decomposition for Particle Methods on the Sphere
We present an algorithm for efficient
parallelization of particle methods when the domain is the surface of
a sphere. Such applications typically arise when dealing with
We propose a domain decomposition scheme based on
geometric partitioning that provides
domains suitable for practical implementation.
This algorithm has the advantage of being
fast enough to be applied dynamically, and at the
same time provides good partitions,
comparable in quality to those produced by
spectral graph partitioning schemes.