Update of /cvsroot/fink/dists/10.4/stable/main/finkinfo/10.4-EOL/sci
In directory vz-cvs-3.sog:/tmp/cvs-serv24321
Added Files:
metis.info metis5.info
Log Message:
sync. w/ 10.!4/stable, validated on powerpc-darwin8
--- NEW FILE: metis5.info ---
Info2: <<
Package: metis5
Version: 5.0.1
Revision: 1
Type: vers (5.0.1)
Description: Graph partitioning and matrix ordering
DescDetail: <<
METIS is a set of serial programs for partitioning graphs, partitioning
finite element meshes, and producing fill reducing orderings for sparse
matrices. The algorithms implemented in METIS are based on the multilevel
recursive-bisection, multilevel k-way, and multi-constraint partitioning
schemes developed in the Karypis Lab at the University of Minnesota.
METIS's key features are the following:
Provides high quality partitions!
Experiments on a large number of graphs arising in various domains including
finite element methods, linear programming, VLSI, and transportation show that
METIS produces partitions that are consistently better than those produced by
other widely used algorithms. The partitions produced by METIS are
consistently 10% to 50% better than those produced by spectral partitioning
algorithms.
It is extremely fast!
Experiments on a wide range of graphs has shown that METIS is one to two
orders of magnitude faster than other widely used partitioning algorithms.
Graphs with over 1,000,000 vertices can be partitioned in 256 parts in a few
seconds on current generation workstations and PCs.
Produces low fill orderings!
The fill-reducing orderings produced by METIS are significantly better than
those produced by other widely used algorithms including multiple minimum
degree. For many classes of problems arising in scientific computations and
linear programming, METIS is able to reduce the storage and computational
requirements of sparse matrix factorization, by up to an order of magnitude.
Moreover, unlike multiple minimum degree, the elimination trees produced by
METIS are suitable for parallel direct factorization. Furthermore, METIS is
able to compute these orderings very fast. Matrices with over 200,000 rows can
be reordered in just a few seconds on current generation workstations and PCs.
<<
DescUsage: This package contains the executables and documentation.
License: OSI-Approved
Maintainer: Alexander Hansen <[email protected]>
Homepage: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview
CustomMirror: <<
nam-US: http://glaros.dtc.umn.edu/gkhome/fetch/sw/metis/OLD
Primary: http://glaros.dtc.umn.edu/gkhome/fetch/sw/metis
<<
Source: mirror:custom:/metis-%v.tar.gz
Source-MD5: 6daba5e64ed86d46e038437eda720532
BuildDepends: cmake
Depends: metis%type_raw[vers]-shlibs (= %v-%r)
Conflicts: metis
Replaces: metis
PatchScript: <<
#!/bin/sh -ev
sed -i.orig -e '/fPIC/s|-fPIC|& -fno-common|g' GKlib/GKlibSystem.cmake
<<
CompileScript: <<
make config shared=1 prefix=%i
make
<<
InfoTest: <<
TestScript: (cd Test ; make ) || exit 2
<<
InstallScript: <<
#!/bin/sh -ev
make install
# clean up install_name in executables
for file in %i/bin/*
do
install_name_tool -change lib%n.%v.dylib %p/lib/lib%n.%v.dylib
$file
done
# fix up library
# create a versioned dylib
cd %i/lib
mv libmetis.dylib libmetis.%v.dylib
ln -s libmetis.%v.dylib libmetis.dylib
install_name_tool -id %p/lib/libmetis.%v.dylib libmetis.%v.dylib
<<
DocFiles: graphs manual LICENSE.txt
SplitOff: <<
Package: metis%type_raw[vers]-shlibs
Files: lib/libmetis.%v.dylib
Shlibs: %p/lib/libmetis.%v.dylib 0.0.0 %n (>= 5.0.1-1)
DescUsage: This package contains a shared library.
DocFiles: LICENSE.txt
<<
SplitOff2: <<
Package: metis%type_raw[vers]-dev
Depends: metis%type_raw[vers]-shlibs (= %v-%r)
Conflicts: metis
Replaces: metis
files: include
DescUsage: This package contains headers and an unversioned dylib
symlink.
DocFiles: LICENSE.txt
<<
DescPackaging: <<
Create a versioned dylib to allow the -shlibs from different %v to coexist,
since in the absense of a compatibility_version it's not clear what the
situation is with respect to ABI.
<<
<<
--- NEW FILE: metis.info ---
Package: metis
Version: 4.0.3
Revision: 2
Description: Graph partitioning and matrix ordering
DescDetail: <<
METIS is a set of serial programs for partitioning graphs, partitioning
finite element meshes, and producing fill reducing orderings for sparse
matrices. The algorithms implemented in METIS are based on the multilevel
recursive-bisection, multilevel k-way, and multi-constraint partitioning
schemes developed in the Karypis Lab at the University of Minnesota.
METIS's key features are the following:
Provides high quality partitions!
Experiments on a large number of graphs arising in various domains including
finite element methods, linear programming, VLSI, and transportation show that
METIS produces partitions that are consistently better than those produced by
other widely used algorithms. The partitions produced by METIS are
consistently 10% to 50% better than those produced by spectral partitioning
algorithms.
It is extremely fast!
Experiments on a wide range of graphs has shown that METIS is one to two
orders of magnitude faster than other widely used partitioning algorithms.
Graphs with over 1,000,000 vertices can be partitioned in 256 parts in a few
seconds on current generation workstations and PCs.
Produces low fill orderings!
The fill-reducing orderings produced by METIS are significantly better than
those produced by other widely used algorithms including multiple minimum
degree. For many classes of problems arising in scientific computations and
linear programming, METIS is able to reduce the storage and computational
requirements of sparse matrix factorization, by up to an order of magnitude.
Moreover, unlike multiple minimum degree, the elimination trees produced by
METIS are suitable for parallel direct factorization. Furthermore, METIS is
able to compute these orderings very fast. Matrices with over 200,000 rows can
be reordered in just a few seconds on current generation workstations and PCs.
<<
DescUsage: <<
This package contains executables, headers, a static library, and
documentation.
<<
License: OSI-Approved
Maintainer: Alexander Hansen <[email protected]>
Homepage: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview
Conflicts: %n5, %n5.0.1-dev
Replaces: %n5, %n5.0.1-dev
CustomMirror: <<
nam-US: http://glaros.dtc.umn.edu/gkhome/fetch/sw/%n/OLD
Primary: http://glaros.dtc.umn.edu/gkhome/fetch/sw/%n
<<
Source: mirror:custom:/%n-%v.tar.gz
Source-MD5: d3848b454532ef18dc83e4fb160d1e10
PatchScript: <<
#!/bin/sh -ev
# proper suffix rules
sed -i.orig -e '1i\
.SUFFIXES: .c .o' Makefile.in
<<
CompileScript: <<
#!/bin/sh -ev
pushd Lib
make
popd
cd Programs
make
<<
InfoTest: <<
TestScript: (cd Test ; make ) || exit 2
<<
InstallScript: <<
#!/bin/sh -ev
mkdir -p %i/bin
cp graphchk kmetis mesh2dual mesh2nodal oemetis onmetis partdmesh
partnmesh pmetis %i/bin
mkdir -p %i/lib
cp libmetis.a %i/lib
mkdir -p %i/include
cp Lib/*.h %i/include
<<
BuildDependsOnly: false
DocFiles: LICENSE VERSION CHANGES Graphs Doc
------------------------------------------------------------------------------
All the data continuously generated in your IT infrastructure contains a
definitive record of customers, application performance, security
threats, fraudulent activity and more. Splunk takes this data and makes
sense of it. Business sense. IT sense. Common sense.
http://p.sf.net/sfu/splunk-d2d-oct
_______________________________________________
Fink-commits mailing list
[email protected]
http://news.gmane.org/gmane.os.apple.fink.cvs
