Before a calculation can be performed on a parallel computer, it must
first be decomposed into tasks which are assigned to different processors.
Efficient use of the machine requires that each processor have about the
same amount of work to do and that the quantity of interprocessor
communication is kept small. Finding an optimal decomposition is provably
hard, but due to its practical importance, a great deal of effort has been
devoted to developing heuristics for this problem. The decomposition
problem can be addressed in terms of graph partitioning.
Chaco implements a variety of algorithms for graph partitioning and is
used at most of the major parallel computing centers around the world to
simplify the development of parallel applications, and to ensure that high
performance is obtained. Chaco has contributed to a wide variety of
computational studies including investigation of the molecular structure
of liquid crystals, evaluating the design of a chemical vapor deposition
reactor and modeling automobile collisions.
Note: this port includes a patch provided by Walter Landry for use within
MBDyn.
===> The following configuration options are available for chaco-2.2:
DOCS=on: Build and/or install documentation
EXAMPLES=on: Build and/or install examples
===> Use 'make config' to modify these settings
math/chaco: fix MASTER_SITES, take maintainership
* Take: maintainership
* Old upstream is totally gone. Move MASTER_SITES on.
The new one is a reputable academic organization:
Mathematics and Computer Science Argonne National Laboratory.
https://www.anl.gov/mcs
PR: 288479
Approved by: yuri@ (Mentor)
Remove WWW entries moved into port Makefiles
Commit b7f05445c00f has added WWW entries to port Makefiles based on
WWW: lines in pkg-descr files.
This commit removes the WWW: lines of moved-over URLs from these
pkg-descr files.
Approved by: portmgr (tcberner)
Add WWW entries to port Makefiles
It has been common practice to have one or more URLs at the end of the
ports' pkg-descr files, one per line and prefixed with "WWW:". These
URLs should point at a project website or other relevant resources.
Access to these URLs required processing of the pkg-descr files, and
they have often become stale over time. If more than one such URL was
present in a pkg-descr file, only the first one was tarnsfered into
the port INDEX, but for many ports only the last line did contain the
port specific URL to further information.
There have been several proposals to make a project URL available as
a macro in the ports' Makefiles, over time.
(Only the first 15 lines of the commit message are shown above )
math: remove 'Created by' lines
A big Thank You to the original contributors of these ports:
* Aaron Dalton <aaron@FreeBSD.org>
* Aaron Dalton <aaron@daltons.ca>
* Alessando Sagratini <ale_sagra@hotmail.com>
* Alex Dupre <ale@FreeBSD.org>
* Alexey Dokuchaev <danfe@FreeBSD.org>
* Amarendra Godbole <amarendra.godbole@gmail.com>
* Anders Nordby <anders@FreeBSD.org>
* Andreas Fehlner (fehlner@gmx.de)
* Andrew L. Neporada <andrew@chg.ru>
* Andrey <gugu@zoo.rambler.ru>
* Andrey Zakhvatov
(Only the first 15 lines of the commit message are shown above )
- Unbreak parallel builds by USES'ing gmake
- Respect CFLAGS in a better, less intrusive way
- Correctly separate DOCS and EXAMPLES
- Trim Makefile header, miscellaneous cleanups
- Reformat port description text
Reported by: pointyhat-west
Reset maintainership: Pedro's dev machine has been stolen :-(
Hoping to see you back soon!
Submitted by: Pedro F. Giffuni <giffunip (at) asme.org> (maintainer)
Before a calculation can be performed on a parallel computer, it must first be
decomposed into tasks which are assigned to different processors. Efficient use
of the machine requires that each processor have about the same amount of work
to do and that the quantity of interprocessor communication is kept small.
Finding an optimal decomposition is provably hard, but due to its practical
importance, a great deal of effort has been devoted to developing heuristics
for this problem.
The decomposition problem can be addressed in terms of graph partitioning. Rob
Leland and I have developed a variety of algorithms for graph partitioning and
implemented them into a package we call Chaco. The code is being used at most
of the major parallel computing centers around the world to simplify the
development of parallel applications, and to ensure that high performance is
obtained. Chaco has contributed to a wide variety of computational studies
including investigation of the molecular structure of liquid crystals,
evaluating the design of a chemical vapor deposition reactor and modeling
automobile collisions.
WWW: http://www.cs.sandia.gov/~bahendr/chaco.html
Note: this port includes a patch provided by Walter Landry for use within MBDyn
PR: ports/96699
Submitted by: Pedro Giffuni <giffunip (at) asme.org>
