Assessments - 2, GPA: 5
(
)
)
|
Facilidade de uso
It gives brief descriptions of the algorithms, details the input/output formats, instructions for use, installation procedures, and provides a number of examples. Scotch is distributed as free/libre software, and has been designed such that new partitioning or ordering methods can be added in a straightforward manner. It can therefore be used as a testbed for the easy and quick coding and testing of such new methods, and may also be redistributed, as a library, along with third-party software that makes use of it, either in its original or in updated forms. 1 Contents 1 Introduction 6 1.1 Staticmapping .............................. 6 1.2 Sparsematrixordering .......................... 6 1.3 Contentsofthisdocument........................ 7 2 The Scotch project 7 2.1 Description ................................ 7 2.2 Availability ................................ 7 3 Algorithms 8 3.1 Static mapping by Dual Recursive Bipartitioning . . . . . . . . . . . 8 3.1.1 Staticmapping.......................... 8 3.1.2 Cost function and performance criteria . . . . . . . . . . . . . 8 3.1.3 The Dual Recursive Bipartitioning algorithm . . . . . . . . . 9 3.1.4 Partial costfunction ....................... 11 3.1.5 Executionscheme ........................ 11 3.1.6 Graphbipartitioning methods. . . . . . . . . . . . . . . . . . 12 3.1.7 Mapping onto variable-sized architectures . . . . . . . . . . . 15 3.2 Sparse matrix ordering by hybrid incomplete nested dissection . . . 15 3.2.1 MinimumDegree......................... 15 3.2.2 Nesteddissection......................... 15 3.2.3 Hybridization........................... 16 3.2.4 Performancecriteria ....................... 16 3.2.5 Ordering methods ........................ 17 3.2.6 Graph separationmethods .................... 18 4 Updates 18 4.1 Changesfromversion4.0 ........................ 18 4.2 Changesfromversion5.0 ........................ 19 5 Files and data structures 19 5.1 Graphfiles ................................ 19 5.2 Meshfiles ................................. 20 5.3 Geometry files .............................. 21 5.4 Targetfiles ................................ 22 5.4.1 Decomposition-defined architecture files . . . . . . . . . . . . 23 5.4.2 Algorithmically-coded architecture files . . . . . . . . . . . . 24 5.4.3 Variable-sized architecture files . . . . . . . . . . . . . . . . . 25 5.5 Mapping files ............................... 25 5.6 Ordering files ............................... 26 5.7 Vertexlistfiles .............................. 26 6 Programs 27 6.1 Invocation................................. 27 6.2 Using compressedfiles .......................... 29 6.3 Description ................................ 29 6.3.1 acpl ................................ 29 6.3.2 amk * ............................... 30 6.3.3 amk grf .............................. 32 6.3.4 atst ................................ 33 2 6.3.5 gcv ................................ 33 6.3.6 gmap /gpart ........................... 34 6.3.7 gmk * ............................... 35 6.3.8 gmk msh .............................. 36 6.3.9 gmtst ............................... 37 6.3.10 gord ................................ 37 6.3.11 gotst ............................... 39 6.3.12 gout ................................ 40 6.3.13 gtst ................................ 43 6.3.14 mcv ................................ 43 6.3.15 mmk * ............................... 44 6.3.16 mord ................................ 44 6.3.17 mtst ................................ 46 7 Library 46 7.1 Calling the routines of libScotch ................... 47 7.1.1 Calling fromC .......................... 47 7.1.2 Calling fromFortran....................... 47 7.1.3 Compiling andlinking ...................... 48 7.1.4 Machineword sizeissues..................... 49 7.2 Dataformats ............................... 49 7.2.1 Architectureformat ....................... 50 7.2.2 Graphformat........................... 50 7.2.3 Meshformat ........................... 52 7.2.4 Geometry format......................... 54 7.2.5 Block ordering format ...................... 56 7.3 Strategy strings.............................. 56 7.3.1 Using defaultstrategy strings . . . . . . . . . . . . . . . . . . 57 7.3.2 Mapping strategy strings .................... 58 7.3.3 Graph bipartitioning strategy strings . . . . . . . . . . . . . . 59 7.3.4 Ordering strategy strings .................... 63 7.3.5 Nodeseparationstrategy strings . . . . . . . . . . . . . . . . 66 7.4 Targetarchitecturehandling routines. . . . . . . . . . . . . . . . . . 70 7.4.1 SCOTCH archInit ......................... 70 7.4.2 SCOTCH archExit ......................... 70 7.4.3 SCOTCH archLoad ......................... 70 7.4.4 SCOTCH archSave ......................... 71 7.4.5 SCOTCH archName ......................... 71 7.4.6 SCOTCH archSize ......................... 72 7.4.7 SCOTCH archBuild ........................ 72 7.4.8 SCOTCH archCmplt ........................ 73 7.4.9 SCOTCH archCmpltw ...