Abstract. In this paper, we present ParaPART, a parallel version of a mesh partitioning tool, called PART, for distributed systems. PART takes into consideration the heterogeneities in processor performance, network performance and application computational complexities to achieve a balanced estimate of execution time across the processors in the distributed system. Simulated annealing is used in PART to perform the backtracking search for desired partitions. ParaPART signi cantly improves performance of PARTby using the asynchronous multiple Markov chain approach of parallel simulated annealing. ParaPART is used to partition six irregular meshes into 8, 16, and 100 subdomains using up to 64 client processors on an IBM SP2 machine. The resu...
Graph partitioning has been shown to be an effective way to divide a large computation over an arbit...
International audienceGraph partitioning is a technique used for the solving of many problems in sci...
Our work deals with simulation of distributed memory parallel computers. The tool we realized allows...
A method is outlined for optimising graph partitions which arise in mapping unstructured mesh calcul...
A method is outlined for optimising graph partitions which arise in mapping un- structured mesh calc...
This paper presents a parallel remeshing algorithm for distributed-memory architectures. It is an it...
A new method is described for optimising graph partitions which arise in mapping unstructured mesh ...
The Alya System is the BSC simulation code for multi-physics problems [1]. It is based on a Variatio...
As polygonal models rapidly grow to sizes orders of magnitudes bigger than the memory of commodity w...
Computational science problems with adaptive meshes involve dynamic load balancing when implemented ...
This talk will present the structure and operations of PaMPA ("Parallel Mesh Partitioning and Adapta...
There are numerous scientific applications which require large and complex meshes. Given the explos...
Graph partitioning is a fundamental problem in many scientific contexts. Algorithms that find a good...
As the efficiency of parallel software increases it is becoming common to measure near linear speedu...
International audienceGraph partitioning is a technique used for solving many problems in scientific...
Graph partitioning has been shown to be an effective way to divide a large computation over an arbit...
International audienceGraph partitioning is a technique used for the solving of many problems in sci...
Our work deals with simulation of distributed memory parallel computers. The tool we realized allows...
A method is outlined for optimising graph partitions which arise in mapping unstructured mesh calcul...
A method is outlined for optimising graph partitions which arise in mapping un- structured mesh calc...
This paper presents a parallel remeshing algorithm for distributed-memory architectures. It is an it...
A new method is described for optimising graph partitions which arise in mapping unstructured mesh ...
The Alya System is the BSC simulation code for multi-physics problems [1]. It is based on a Variatio...
As polygonal models rapidly grow to sizes orders of magnitudes bigger than the memory of commodity w...
Computational science problems with adaptive meshes involve dynamic load balancing when implemented ...
This talk will present the structure and operations of PaMPA ("Parallel Mesh Partitioning and Adapta...
There are numerous scientific applications which require large and complex meshes. Given the explos...
Graph partitioning is a fundamental problem in many scientific contexts. Algorithms that find a good...
As the efficiency of parallel software increases it is becoming common to measure near linear speedu...
International audienceGraph partitioning is a technique used for solving many problems in scientific...
Graph partitioning has been shown to be an effective way to divide a large computation over an arbit...
International audienceGraph partitioning is a technique used for the solving of many problems in sci...
Our work deals with simulation of distributed memory parallel computers. The tool we realized allows...