Results 1  10
of
10
Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes
, 1997
"... this paper we describe such a parallel optimization technique ..."
Abstract

Cited by 84 (18 self)
 Add to MetaCart
this paper we describe such a parallel optimization technique
Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes
 JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
, 1997
"... For a large class of irregular mesh applications, the structure of the mesh changes from one phase of the computation to the next. Eventually, as the mesh evolves, the adapted mesh has to be repartitioned to ensure good load balance. If this new graph is partitioned from scratch, it may lead to an ..."
Abstract

Cited by 66 (7 self)
 Add to MetaCart
For a large class of irregular mesh applications, the structure of the mesh changes from one phase of the computation to the next. Eventually, as the mesh evolves, the adapted mesh has to be repartitioned to ensure good load balance. If this new graph is partitioned from scratch, it may lead to an excessive migration of data among processors. In this paper, we present schemes for computing repartitionings of adaptively refined meshes that perform diffusion of
Mesh Partitioning: a Multilevel Balancing and Refinement Algorithm
, 1998
"... Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. In this paper we present an enhancement o ..."
Abstract

Cited by 56 (22 self)
 Add to MetaCart
Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. In this paper we present an enhancement of the technique which uses imbalance to achieve higher quality partitions. We also present a formulation of the KernighanLin partition optimisation algorithm which incorporates loadbalancing. The resulting algorithm is tested against a different but related stateofthe art partitioner and shown to provide improved results. Keywords: graphpartitioning, mesh partitioning, loadbalancing, multilevel algorithms. 1 Introduction The need for mesh partitioning arises naturally in many finite element (FE) and finite volume (FV) applications. Meshes composed of elements such as triangles or tetrahedra are often better suited than regularly structured grids for representing completely general ge...
Graph partitioning for high performance scientific simulations. Computing Reviews 45(2
, 2004
"... ..."
A unified algorithm for loadbalancing adaptive scientific simulations
 In Proceedings of the ACM/IEEE Symposium on Supercomputing (SCâ€™00). IEEE Computer
, 2000
"... Adaptive scientific simulations require that periodic repartitioning occur dynamically throughout the course of the computation. The repartitionings should be computed so as to minimize both the interprocessor communications incurred during the iterative meshbased computation and the data redistri ..."
Abstract

Cited by 38 (2 self)
 Add to MetaCart
Adaptive scientific simulations require that periodic repartitioning occur dynamically throughout the course of the computation. The repartitionings should be computed so as to minimize both the interprocessor communications incurred during the iterative meshbased computation and the data redistribution costs required to balance the load. Recently developed schemes for computing repartitionings provide the user with only a limited control of the tradeoffs among these objectives. This paper describes a new Unified Repartitioning Algorithm that can tradeoff one objective for the other dependent upon a userdefined parameter describing the relative costs of these objectives. We show that the Unified Repartitioning Algorithm is able to reduce the precise overheads associated with repartitioning as well as or better than other repartitioning schemes for a variety of problems, regardless of the relative costs of performing interprocessor communication and data redistribution. Our experimental results show that this scheme is extremely fast and scalable to large problems.
Multilevel Algorithms for Wavefront Reduction
 SIAM J. SCIENTIFIC COMPUTING
, 2000
"... Multilevel algorithms are proposed for reordering sparse symmetric matrices to reduce the wavefront and profile. A graph representation of the matrix is used and two graph coarsening methods are investigated. A multilevel algorithm that uses a maximal independent vertex set for coarsening and the Sl ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
Multilevel algorithms are proposed for reordering sparse symmetric matrices to reduce the wavefront and profile. A graph representation of the matrix is used and two graph coarsening methods are investigated. A multilevel algorithm that uses a maximal independent vertex set for coarsening and the Sloan algorithm on the coarsest graph is shown to produce orderings that are of a similar quality to those obtained using the best existing combinatorial algorithm (the hybrid Sloan algorithm). Advantages of the proposed algorithm over the the hybrid Sloan algorithm are that it does not require any spectral information and is significantly faster, requiring on average half the CPU time.
Parallel Dynamic GraphPartitioning for Unstructured Meshes
, 1997
"... A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimisation technique known as relative gain optimisation which both balances the workload and attempts to minimise the interprocessor communications overhead. Experiments on a ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimisation technique known as relative gain optimisation which both balances the workload and attempts to minimise the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equivalent or higher quality to static partitioners (which do not reuse the existing partition) and much more rapidly. Perhaps more importantly, the algorithm results in only a small fraction of the amount of data migration compared to the static partitioners.
Parallel Multilevel Diffusion Algorithms for Repartitioning of Adaptive Meshes
, 1997
"... Graph partitioning has been shown to be an effective way to divide a large computation over an arbitrary number of processors. A good partitioning can ensure load balance and minimize the communication overhead of the computation by partitioning an irregular mesh into p equal parts while minimizin ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Graph partitioning has been shown to be an effective way to divide a large computation over an arbitrary number of processors. A good partitioning can ensure load balance and minimize the communication overhead of the computation by partitioning an irregular mesh into p equal parts while minimizing the number of edges cut by the partition. For a large class of irregular mesh applications, the structure of the graph changes from one phase of the computation to the next. Eventually, as the graph evolves, the adapted mesh has to be repartitioned to ensure good load balance. Failure to do so will lead to higher parallel run time. This repartitioning needs to maintain a low edgecut in order to minimize communication overhead in the followon computation. It also needs to minimize the time for physically migrating data from one processor to another since this time can dominate overall run time. Finally, it must be fast and scalable since it may be necessary to repartition frequently...
Parallel Partitioning of Unstructured Meshes
 Parallel Computational Fluid Dynamics: Algorithms and Results Using Advanced Computers
, 1996
"... this paper we discuss the partition optimisation problem and its bearing on the graph partitioning problem. In particular, the algorithms outlined in this paper are designed to address the three problems that arise in partitioning of unstructured finite element and finite volume meshes. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
this paper we discuss the partition optimisation problem and its bearing on the graph partitioning problem. In particular, the algorithms outlined in this paper are designed to address the three problems that arise in partitioning of unstructured finite element and finite volume meshes.
Parallel Unstructured Mesh Partitioning
, 1998
"... this paper we discuss the partition optimisation problem and its bearing on the graph partitioning problem ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
this paper we discuss the partition optimisation problem and its bearing on the graph partitioning problem