Ubuntu
scotch package

scotch 5.1.12b.dfsg-2build4 source package in Ubuntu

Changelog

scotch (5.1.12b.dfsg-2build4) xenial; urgency=medium

  * No-change rebuild for openmpi on s390x.

 -- Matthias Klose <email address hidden>  Sat, 06 Feb 2016 19:52:53 +0000

Upload details

Uploaded by:
Matthias Klose
Uploaded to:
Xenial
Original maintainer:
Debian Science Team
Architectures:
any
Section:
math
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Xenial release universe math

Downloads

File Size SHA-256 Checksum
scotch_5.1.12b.dfsg.orig.tar.gz 1.6 MiB 7c3644cbe4de65b25a46c922a9139e71bf396b675aa2cdd9228e7cc85bce8b36
scotch_5.1.12b.dfsg-2build4.debian.tar.xz 21.3 KiB dd1d613f3a6e3e51a29527892f070f9093792ae20c7fd7a17c049fa9692e30f9
scotch_5.1.12b.dfsg-2build4.dsc 2.7 KiB 2f081f5f0afe8393eca7d437c6e004e736d4a107f88288e083ec408a2e1c7902

View changes file

Binary packages built by this source

libptscotch-5.1: No summary available for libptscotch-5.1 in ubuntu yakkety.

No description available for libptscotch-5.1 in ubuntu yakkety.

libptscotch-5.1-dbgsym: debug symbols for package libptscotch-5.1

 Shared libraries package for PT-SCOTCH, the MPI version of scotch, which
 is a set of programs and libraries which implement the static mapping and
 sparse matrix reordering algorithms developed within the SCOTCH project.

libptscotch-dbg: No summary available for libptscotch-dbg in ubuntu yakkety.

No description available for libptscotch-dbg in ubuntu yakkety.

libptscotch-dev: MPI programs and libraries for graph, mesh and hypergraph partitioning

 Headers and libraries package for PT-SCOTCH, the MPI version of scotch, which
 is a set of programs and libraries which implement the static mapping and
 sparse matrix reordering algorithms developed within the SCOTCH project.

libscotch-5.1: No summary available for libscotch-5.1 in ubuntu zesty.

No description available for libscotch-5.1 in ubuntu zesty.

libscotch-5.1-dbgsym: No summary available for libscotch-5.1-dbgsym in ubuntu yakkety.

No description available for libscotch-5.1-dbgsym in ubuntu yakkety.

libscotch-dbg: No summary available for libscotch-dbg in ubuntu yakkety.

No description available for libscotch-dbg in ubuntu yakkety.

libscotch-dev: programs and libraries for graph, mesh and hypergraph partitioning

 Headers and libraries package for scotch, which is a set of programs and
 libraries which implement the static mapping and sparse matrix reordering
 algorithms developed within the SCOTCH project.

libscotchmetis-dev: No summary available for libscotchmetis-dev in ubuntu yakkety.

No description available for libscotchmetis-dev in ubuntu yakkety.

libscotchparmetis-dev: No summary available for libscotchparmetis-dev in ubuntu yakkety.

No description available for libscotchparmetis-dev in ubuntu yakkety.

ptscotch: No summary available for ptscotch in ubuntu yakkety.

No description available for ptscotch in ubuntu yakkety.

ptscotch-dbg: No summary available for ptscotch-dbg in ubuntu yakkety.

No description available for ptscotch-dbg in ubuntu yakkety.

ptscotch-dbgsym: No summary available for ptscotch-dbgsym in ubuntu zesty.

No description available for ptscotch-dbgsym in ubuntu zesty.

scotch: programs and libraries for graph, mesh and hypergraph partitioning

 Its purpose is to apply graph theory, with a divide and conquer
 approach, to scientific computing problems such as graph and mesh
 partitioning, static mapping, and sparse matrix ordering, in
 application domains ranging from structural mechanics to operating
 systems or bio-chemistry.
 .
 The SCOTCH distribution is a set of programs and libraries which
 implement the static mapping and sparse matrix reordering algorithms
 developed within the SCOTCH project.
 .
 SCOTCH has many interesting features:
 .
 o Its capabilities can be used through a set of stand-alone programs
 as well as through the libSCOTCH library, which offers both C and
 Fortran interfaces.
 .
 o It provides algorithms to partition graph structures, as well as
 mesh structures defined as node-element bipartite graphs and which
 can also represent hypergraphs.
 .
 o It can map any weighted source graph onto any weighted target
 graph. The source and target graphs may have any topology, and their
 vertices and edges may be weighted. Moreover, both source and target
 graphs may be disconnected. This feature allows for the mapping of
 programs onto disconnected subparts of a parallel architecture made
 up of heterogeneous processors and communication links.
 .
 o It computes amalgamated block orderings of sparse matrices, for
 efficient solving using BLAS routines.
 .
 o Its running time is linear in the number of edges of the source
 graph, and logarithmic in the number of vertices of the target graph
 for mapping computations.
 .
 o It can handle indifferently graph and mesh data structures created
 within C or Fortran programs, with array indices starting from 0 or
 1.
 .
 o It offers extended support for adaptive graphs and meshes through
 the handling of disjoint edge arrays.
 .
 o It is dynamically parametrizable thanks to strategy strings that
 are interpreted at run-time.
 .
 o It uses system memory efficiently, to process large graphs and
 meshes without incurring out-of-memory faults;
 .
 o It is highly modular and documented. Since it has been released
 under the CeCILL-C free/libre software license, it can be used as a
 testbed for the easy and quick development and testing of new
 partitioning and ordering methods.
 .
 o It can be easily interfaced to other programs. The programs
 comprising the SCOTCH project have been designed to run in
 command-line mode without any interactive prompting, so that they can
 be called easily from other programs by means of system() or popen()
 calls, or piped together on a single command line. Moreover, vertex
 labeling capabilities allow for easy renumbering of vertices.
 .
 o It provides many tools to build, check, and display graphs, meshes
 and matrix patterns.
 .
 o It is written in C and uses the POSIX interface, which makes it
 highly portable. PT-SCOTCH uses the MPI interface, and optionally the
 POSIX threads.

scotch-dbg: programs and libraries for graph, mesh and hypergraph partitioning

 Debug symbols package for scotch, which is a set of programs and
 libraries which implement the static mapping and sparse matrix reordering
 algorithms developed within the SCOTCH project.

scotch-dbgsym: debug symbols for package scotch

 Its purpose is to apply graph theory, with a divide and conquer
 approach, to scientific computing problems such as graph and mesh
 partitioning, static mapping, and sparse matrix ordering, in
 application domains ranging from structural mechanics to operating
 systems or bio-chemistry.
 .
 The SCOTCH distribution is a set of programs and libraries which
 implement the static mapping and sparse matrix reordering algorithms
 developed within the SCOTCH project.
 .
 SCOTCH has many interesting features:
 .
 o Its capabilities can be used through a set of stand-alone programs
 as well as through the libSCOTCH library, which offers both C and
 Fortran interfaces.
 .
 o It provides algorithms to partition graph structures, as well as
 mesh structures defined as node-element bipartite graphs and which
 can also represent hypergraphs.
 .
 o It can map any weighted source graph onto any weighted target
 graph. The source and target graphs may have any topology, and their
 vertices and edges may be weighted. Moreover, both source and target
 graphs may be disconnected. This feature allows for the mapping of
 programs onto disconnected subparts of a parallel architecture made
 up of heterogeneous processors and communication links.
 .
 o It computes amalgamated block orderings of sparse matrices, for
 efficient solving using BLAS routines.
 .
 o Its running time is linear in the number of edges of the source
 graph, and logarithmic in the number of vertices of the target graph
 for mapping computations.
 .
 o It can handle indifferently graph and mesh data structures created
 within C or Fortran programs, with array indices starting from 0 or
 1.
 .
 o It offers extended support for adaptive graphs and meshes through
 the handling of disjoint edge arrays.
 .
 o It is dynamically parametrizable thanks to strategy strings that
 are interpreted at run-time.
 .
 o It uses system memory efficiently, to process large graphs and
 meshes without incurring out-of-memory faults;
 .
 o It is highly modular and documented. Since it has been released
 under the CeCILL-C free/libre software license, it can be used as a
 testbed for the easy and quick development and testing of new
 partitioning and ordering methods.
 .
 o It can be easily interfaced to other programs. The programs
 comprising the SCOTCH project have been designed to run in
 command-line mode without any interactive prompting, so that they can
 be called easily from other programs by means of system() or popen()
 calls, or piped together on a single command line. Moreover, vertex
 labeling capabilities allow for easy renumbering of vertices.
 .
 o It provides many tools to build, check, and display graphs, meshes
 and matrix patterns.
 .
 o It is written in C and uses the POSIX interface, which makes it
 highly portable. PT-SCOTCH uses the MPI interface, and optionally the
 POSIX threads.