𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph partitioning based methods and tools for scientific computing

✍ Scribed by François Pellegrini

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
881 KB
Volume
23
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

The combinatorial optimization problem of assigning the communicating coexisting processes of a parallel program onto a parallel machine so as to minimize its overall execution time is called static mapping. This paper presents the work that has been carried out to date at the LaBRI on static mapping. We introduce a static mapping algorithm based on the recursive bipartitioning of both the source process graph and the target architecture graph and describe the capabilities of SCOTCH 3. I, a software package that implements this method. SCOTCH can efficiently map any weighted source graph onto any weighted target graph in a time linear in the number of source edges and logarithmic in the number of target vertices. We give brief descriptions of the algorithm and its bipartitioning methods and compare the performance of our mapper with respect to other mapping and partitioning software packages.

📜 SIMILAR VOLUMES

Workshop on environments and tools for p
Workshop on environments and tools for parallel scientific computing
✍ J. Dongarra; B. Tourancheau 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 219 KB

This publication is based on the proceedings of the International Workshop "Environments and Tools for Parallel Scientific Computing" which took place at Faverges de la Tour (France) on August 22-23, 1996. This was the third in a series of workshops intended to provide a forum in which researchers i

An Open Source performance tools softwar
An Open Source performance tools software suite for scientific computing
✍ Philip J. Mucci; Tushar Mohan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB 👁 1 views

## Abstract With the rapid replacement of closed, homogeneous, proprietary HPC systems by heterogeneous, Linux‐MPI cluster systems, the state of performance monitoring and analysis tools has become a cause for concern. Proprietary systems, despite their drawbacks, provided consistent tools of high

A neural network graph partitioning proc
A neural network graph partitioning procedure for grid-based domain decomposition
✍ C. C. Pain; C. R. E De Oliveira; A. J. H. Goddard 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB 👁 2 views

This paper describes a neural network graph partitioning algorithm which partitions unstructured ÿnite element/volume meshes as a precursor to a parallel domain decomposition solution method. The algorithm works by ÿrst constructing a coarse graph approximation using an automatic graph coarsening me