Software for mesh partitioning
Tutor / director / evaluatorRuiz Boqué, Sílvia
Document typeMaster thesis
Rights accessOpen Access
Graph partitioning is a fundamental problem in many scientific contexts. Algorithms that find a good partitioning of highly unstructured graphs are critical for developing efficient solutions for a wide range of problems in many application areas on both serial and parallel computers. For example, large‐scale numerical simulations on parallel computers, such as those based on finite element methods; require the distribution of the finite element mesh to the processors. This distribution must be done so that the number of elements assigned to each processor is the same, and the number of adjacent elements assigned to different processors is minimized. The goal of the first condition is to balance the computations among the processors. The goal of the second condition is to minimize the communication resulting from the placement of adjacent elements to different processors. Graph partitioning can be used to successfully satisfy these conditions by first modeling the finite element mesh by a graph, and then partitioning it into equal parts. Software for graph partitioning is widely available. This document contains a brief summary of the most famous ones and a detailed explanation of MeTis Graph Partitioning Software and a Matlab toolbox, justified in the following section the choice of this software.