Loading...
Please wait, while we are loading the content...
Similar Documents
Scotch 3.0 User's Guide
| Content Provider | Semantic Scholar |
|---|---|
| Author | Cois, Frann Labri, Pellegrini |
| Copyright Year | 1995 |
| Abstract | The eecient execution of a parallel program on a parallel machine requires good placement of the communicating processes of the program onto the processors of the machine. When both the program and the machine are modeled in terms of weighted unoriented graphs, this problem amounts to static graph mapping. This document describes the capabilities and operations of Scotch, a software package devoted to graph mapping, based on the Dual Recursive Bipartitioning algorithm. Predeened mapping strategies allow for recursive application of any of several graph bipartitioning methods, including Fiduccia-Mattheyses and Gibbs-Poole-Stockmeyer methods. Scotch can map any weighted process graph onto any weighted target graph, whether they are connected or not. We give brief descriptions of the algorithm and bipartitioning methods, detail the input/output formats, instructions for use, and installation procedures, and provide a number of examples. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://wotug.ukc.ac.uk/parallel/libraries/communication/scotch/scotch_user3.0.ps.gz |
| Alternate Webpage(s) | http://www.labri.fr/Labri/Publications/Rapports-internes/RR-109595.ps.Z |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
