Parallel Mesh-partitioning Algorithms For Generating Shape Optimised Partitions Using Evolutionary Computing

摘要

In this paper, parallel mesh-partitioning algorithms are proposed for generating submeshes with optimal shape using evolutionary computing techniques.It is preferred to employ a formulation for mesh parti-tioning, which maintains constant number of design variables irrespective of the size of the mesh.Two distinct parallel computing models have been employed.The first model of parallel evolutionary algo-rithm uses the master-slave concept (single population model) and a new synchronous model is pro-posed to optimise the performance even on heterogeneous parallel hardware.Alternatively, a multiple population model is also developed which simulates it's sequential counter part.The advantage of the second model is that it can fit in large size problems with large population even on moderate capacity parallel computing nodes.The performance of the evolutionary computing based mesh-partitioning algo-rithm is demonstrated first by solving several practical engineering problems and also several benchmark test problems available in the literature and comparing the results with the multilevel algorithms.Later the speedup of the parallel evolutionary algorithms on parallel hardware is evaluated by solving large scale practical engineering problems.