notbugAs an Amazon Associate I earn from qualifying purchases.
Want a good read? Try FreeBSD Mastery: Jails (IT Mastery Book 15)
Want a good monitor light? See my photosAll times are UTC
Ukraine
This referral link gives you 10% off a Fastmail.com account and gives me a discount on my Fastmail account.

Get notified when packages are built

A new feature has been added. FreshPorts already tracks package built by the FreeBSD project. This information is displayed on each port page. You can now get an email when FreshPorts notices a new package is available for something on one of your watch lists. However, you must opt into that. Click on Report Subscriptions on the right, and New Package Notification box, and click on Update.

Finally, under Watch Lists, click on ABI Package Subscriptions to select your ABI (e.g. FreeBSD:14:amd64) & package set (latest/quarterly) combination for a given watch list. This is what FreshPorts will look for.

non port: math/chaco/pkg-plist

Number of commits found: 3

Thursday, 13 Nov 2014
23:24 antoine search for other commits by this committer
Cleanup plist
Original commitRevision:372546 
Friday, 19 Jul 2013
12:50 danfe search for other commits by this committer
- 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
Original commitRevision:323285 
Wednesday, 3 May 2006
21:10 thierry search for other commits by this committer
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>
Original commit

Number of commits found: 3