Transparent Gif

Department of Computer Science

University of California, Santa Barbara

Abstract

Parallelization of Particle Methods on the Sphere

by: Omer Egecioglu and Ashok Srinivasan

Abstract:

We consider data structures and algorithms for efficient parallelization ofparticle methods when the domain is the surface of a sphere. Such applicationstypically arise when dealing with directional data. We propose a domaindecomposition scheme based on a combination of geometric and combinatorialpartitioning, that provides domains suitable for efficient implementation ofrequisite operations that are performed on the data in parallel. The algorithmhas the advantage of being fast enough to be applied dynamically, and at thesame time provides good partitions, comparable in quality to those produced bymultilevel graph partitioning schemes.

Keywords:

Domain decomposition, particle method, parallel algorithm, smoothedparticle hydrodynamics.

Date:

May 31, 1996

Document: 1996-10

XHTML Validation | CSS Validation
Updated 14-Nov-2005
Questions should be directed to: webmaster@cs.ucsb.edu