Abstract
A new method is described for solving the graph-partitioning problem which arises in mapping unstructured mesh calculations to parallel computers. The method, encapsulated in a software tool, JOSTLE, employs a combination of techniques including the Greedy algorithm to give an initial partition together with some powerful optimisation heuristics. A clustering technique is additionally employed to speed up the whole process. The resulting partitioning method is designed to work efficiently in parallel as well as sequentially and can be applied to both static and dynamically refined meshes. Experiments, on graphs with up to a million nodes, indicate that the JOSTLE procedure is up to an order of magnitude faster than existing state-of-the-art techniques such as Multilevel Recursive Spectral Bisection.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. T. Barnard and H. D. Simon. A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems. Con-currency: Practice and Experience, 6 (2): 101–117, 1994.
D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Prentice Hall, Englewood Cliffs, NJ, 1989.
G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. J. Par. Dist. Comput., 7: 279–301, 1989.
C. Farhat. A Simple and Efficient Automatic FEM Domain Decomposer. Comp. and Struct., 28: 579–602, 1988.
C. Farhat and H. D. Simon. TOP/DOMDEC — a Software Tool for Mesh Partitioning and Parallel Processing. Tech. Rep. RNR-93–011, NASA Ames, Moffat Field, CA., 1993.
C. M. Fiduccia and R. M. Mattheyses. A Linear Time Heuristic for Improving Network Partitions. In Proc. 19th IEEE Design Automation Conf., pages 175–181, IEEE, 1982.
B. Hendrickson and R. Leland. Multidimensional Spectral Load Balancing. Tech. Rep. SAND 93–0074, Sandia National Labs, Albuquerque, NM., 1992.
B. Hendrickson and R. Leland. A Multilevel Algorithm for Partitioning Graphs. Tech. Rep. SAND 93–1301, Sandia National Labs, Albuquerque, NM., 1993.
B. W. Jones. Mapping Unstructured Mesh Codes onto Local Memory Parallel Architectures. PhD thesis, School of Maths., University of Greenwich, London SE18 6PF, UK, 1994.
B. W. Kernighan and S. Lin. An Efficient Heuristic for Partitioning Graphs. Bell Systems Tech. J., 49: 291–308, 1970.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220: 671–680, 1983.
P. Lawrence. Mesh Generation by Domain Bisection. PhD thesis, School of Maths., University of Greenwich, London SE18 6PF, UK, 1994.
R. Lohner, R. Ramamurti, and D. Martin. A Parallelizable Load Balancing Algorithm. AIAA-93–0061, 1993.
K. McManus, M. Cross, and S. Johnson. Integrated Flow and Stress using an Unstructured Mesh on Distributed Memory Parallel Systems. (submitted for the Proceedings, Parallel Computational Fluid Dynamics ‘84), University of Greenwich, London, SE18 6PF, UK, 1994.
J. Savage and M. Wloka. Parallelism in Graph Partitioning. J. Par. Dist. Comput., 13: 257–272, 1991.
N. G. Shivaratri, P. Krueger, and M. Singhal. Load distributing for locally distributed systems. IEEE Comput., 25 (12): 33–44, 1992.
J. Song. A partially asynchronous and iterative algorithm for distributed load balancing. Parallel Comput., 20: 853–868, 1994.
P. R. Suaris and G. Kedem. An Algorithm for Quadrisection and Its Application to Standard Cell Placement. IEEE Trans. Circuits and Systems, 35 (3): 294–303, 1988.
D. Vanderstraeten and R. Kennings. Optimized Partitioning of Unstructured Finite Element Meshes. CESAME Tech. Rep. 93.32 (accepted by Int. J. Num. Meth. Engng.),1993.
C. Walshaw and M. Cross. A Parallelisable Algorithm for Optimising Unstructured Mesh Partitions. (submitted for publication), 1994.
C. Walshaw, M. Cross, S. Johnson, and M. Everett. JOSTLE: Partitioning of Unstructured Meshes for Massively Parallel Machines. (submitted for the Proceedings, Parallel CFD’94), 1994.
C. Walshaw, M. Cross, S. Johnson, and M. Everett. Mapping Unstructured Meshes to Parallel Machine Topologies. (in preparation ), 1994.
C. H. Walshaw and M. Berzins. Dynamic Load-Balancing For PDE Solvers On Adaptive Unstructured Meshes. (accepted by Concurrency: Practice and Experience), 1993.
R. D. Williams. Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency: Practice F5 Experience, 3: 457–481, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Walshaw, C., Cross, M., Everett, M., Johnson, S. (1995). A Parallelisable Algorithm for Partitioning Unstructured Meshes. In: Ferreira, A., Rolim, J.D.P. (eds) Parallel Algorithms for Irregular Problems: State of the Art. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6130-6_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6130-6_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4747-5
Online ISBN: 978-1-4757-6130-6
eBook Packages: Springer Book Archive