On Tue, Jul 05, 2005 at 11:03:55PM +0200, Poul-Henning Kamp wrote: > In message <20050705205956.GD49841_at_decibel.org>, "Jim C. Nasby" writes: > >On Mon, Jul 04, 2005 at 05:44:49PM +0900, gnn_at_freebsd.org wrote: > >> At Mon, 04 Jul 2005 10:25:34 +0200, > >> Poul-Henning Kamp wrote: > >> > I played with developing that graph by removing lines from LINT > >> > and see what compiled and what didn't. Based on the progress I > >> > made I would estimate the full graph will take about 1 CPU-year to > >> > calculate by trial&error. > >> > >> Hmm. Well, either I need a very fast CPU, or a more clever approach. > >> I guess we'll see... > > > >How hard would it be to distribute this? > > It could trivially be distributed, but I think it is better to use > a bit of brain to get a smarter approach first :-) A CPU year isn't all that bad. Write a bit of code to submit it as a set of SGE jobs and I can turn it around in a few days without much trouble. We produce a bit over a CPU year per day on our FreeBSD cluster. :-) We regularly run problems that take a few CPU decades. -- Brooks -- Any statement of the form "X is the one, true Y" is FALSE. PGP fingerprint 655D 519C 26A7 82E7 2529 9BF0 5D8E 8BE9 F238 1AD4
This archive was generated by hypermail 2.4.0 : Wed May 19 2021 - 11:38:38 UTC