New graph partitioning techniques for load balancing of coupled simulation

Replication factor: Figure 7 shows the replication factor of Oblivious, HDRF and WSGP algorithms in different win- dow size settings (the x-axis is the percentage of the

For that task, we propose a new method, called bootstrap clustering which consists in (i) defining a new clustering algorithm for graphs, (ii) building a set of graphs similar to

Input: initial partition P A clp on a subgraph Constraint: vertices in P A clp should remain fixed Output: partition P A of the whole graph. Input: initial partition P A on the

Fig. Four different decompositions of a graph into fixed points of degree peeling. The induced subgraphs formed by taking all vertices in a hull is a fixed point of degree peeling.

D. MxN Repartitioning Algorithm based on Fixed Vertices Our algorithm uses a partitioning technique based on fixed vertices in a similar way to Zoltan [2] or RM-Metis [9]. As

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

We introduce a new potential function that favors the creation of homogeneous clusters to- gether with an iterative algorithm that place seeds vertices at smart

By triple puncturing of the dodecacode, we obtain an additive code of length 9, and taking its coset graph, we construct a strongly regular graph of parameters ( 64 , 27 , 10 , 12