Abstract
Recursive Spectral Bisection (RSB) has been proposed as an efficient heuristic algorithm for partitioning problem for unstructured problems about six years ago, and has since become a widely used tool when implementing finite element applications on parallel processors. However, many applications have a dynamically changing communication pattern, e.g. unstructured grid problems with adaptive refinement. In this talk we will outline a method which combines the advantages of RSB with the capability of quickly updating a partitioning, if the underlyng grid is dynamically changing. We call this method dynamic spectral partitioning (DSP). We will discuss the derivation of DSP, and motivate it with applications from structural analysis and computational chemistry. Then, using an adaptive grid refinement 3d Navier-Stokes code on the IBM SP-2, we will demonstrate how DSP can be applied to the solution of practical problems.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simon, H.D., Sohn, A. (1996). Dynamic spectral partitioning. 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/BFb0030099
Download citation
DOI: https://doi.org/10.1007/BFb0030099
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