Abstract
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 directional data. 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.
Preview
Unable to display preview. Download preview PDF.
References
Barnes, J., Hut, P.: A hierarchical O(NlogN) force-calculation algorithm. Nature 3 (1986) 446–449
Berger, M.J., Bokhari, S.H.: A partitioning strategy for nonuniform problems on multiprocessors. IEEE Transactions on Computers C-36 (1987) 570–80
Young, W.S., Brooks III, C.L.: Implementation of a Data Parallel, Logical Domain Decomposition Method for Interparticle Interaction in Molecular Dynamics of Structured Molecular Fluids. Journal of Computational Chemistry 15 (1994) 44–53
Monaghan, J.J.: Particle Methods for Hydrodynamics. Computer Physics Reports 3 (1985) 71–124
Harlow, F.H.: The Particle-in-Cell Computing Method for Fluid Dynamics. Meth. Comput. Phys. 3 (1964) 319–343
Eğecioğlu, Ö., Srinivasan, A.: Efficient Nonparametric Estimation of Probability Density Functions. Technical Report TRCS95-21, University of California at Santa Barbara, 1995
Eğecioğlu, Ö., Srinivasan, A.: Parallelization of Particle Methods on the Sphere, Technical Report TRCS96-10, University of California at Santa Barbara, 1996
Leighton, F.T.: Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. M. Kaufmann Publishers, San Mateo, California, 1992
Hendrickson, B., Leland, R.: The Chaco User's Guide, Version 2.0. SAND95-2344, Sandia National Laboratories
Hendrickson, B., Leland, R.: A Multilevel Algorithm for Partitioning Graphs. SAND93-1301, Sandia National Laboratories
Karypis, G., Kumar, V.: METIS, Unstructured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0. Dept. of Computer Science, University of Minnesota, 1995
Williams, R.D.: Performance of Dynamic Load Balancing Algorithms for Unstructured Mesh Calculations. Concurrency 3 (1991) 457–481
Kernighan, B.W., Lin S.: An Efficient Heuristic Procedure for Partitioning Graphs. Bell System Technical Journal, 1970
Chaubal, C., Leal, L.G.: The Effect of Flow Type on the Rheology of Liquid Crystalline Polymers. Society of Rheology, 67th Annual Meeting, Sacramento, CA Oct 8–12, 1995
Plimpton, S.: Fast Parallel Algorithms for Short-Range Molecular Dynamics. J. Comp. Phys. 117 (1995) 1–19
Barnard, S.T., Simon, H.: A parallel implementation of multilevel recursive spectral bisection for application to adaptive unstructured meshes. In: Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, San Francisco, CA, USA, 15–17 Feb. 1995. Edited by: Bailey, D.H.; Bjorstad, P.E.; Gilbert, J.R.; Mascagni, M.V.; and others. Philadelphia, PA: SIAM, 1995, 627–32
Szeri, A., Leal, L.G.: A new computational method for the solution of flow problems of microstructured fluids. Part 2. Inhomogeneous shear flow of a suspension. Journal of Fluid Mechanics 262 (1994) 171–204
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eğecioğlu, Ö., Srinivasan, A. (1996). Domain decomposition for particle methods on the sphere. In: Ferreira, A., Rolim, J., Saad, Y., Yang, T. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1996. Lecture Notes in Computer Science, vol 1117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030102
Download citation
DOI: https://doi.org/10.1007/BFb0030102
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61549-1
Online ISBN: 978-3-540-68808-2
eBook Packages: Springer Book Archive