aboutsummaryrefslogtreecommitdiff
path: root/math/chaco
Commit message (Collapse)AuthorAgeFilesLines
* Cleanup plistAntoine Brodin2014-11-131-2/+0
| | | | Notes: svn path=/head/; revision=372546
* - Add stage supportDanilo Egea Gondolfo2014-02-151-15/+8
| | | | Notes: svn path=/head/; revision=344389
* Add NO_STAGE all over the place in preparation for the staging support (cat: ↵Baptiste Daroussin2013-09-201-0/+1
| | | | | | | math) Notes: svn path=/head/; revision=327746
* Small, non-functional changes (cleanups).Alexey Dokuchaev2013-07-191-1/+0
| | | | Notes: svn path=/head/; revision=323290
* - Unbreak parallel builds by USES'ing gmakeAlexey Dokuchaev2013-07-193-40/+41
| | | | | | | | | | | | - 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 Notes: svn path=/head/; revision=323285
* Style: tab -> space.Eitan Adler2013-03-281-1/+1
| | | | | | | Most contributors copy an existing port when writing their own so reduce the number of bad examples in the tree. Notes: svn path=/head/; revision=315487
* - Get Rid MD5 supportMartin Wilke2011-03-201-1/+0
| | | | Notes: svn path=/head/; revision=271346
* Reset maintainership: Pedro's dev machine has been stolen :-(Thierry Thomas2006-07-011-1/+1
| | | | | | | | | Hoping to see you back soon! Submitted by: Pedro F. Giffuni <giffunip (at) asme.org> (maintainer) Notes: svn path=/head/; revision=166704
* Before a calculation can be performed on a parallel computer, it must first beThierry Thomas2006-05-038-0/+152
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> Notes: svn path=/head/; revision=161300