This is the mail archive of the
guile@cygnus.com
mailing list for the Guile project.
Re: Well, that's interesting.
- To: Mark Galassi <rosalia@lanl.gov>
- Subject: Re: Well, that's interesting.
- From: Havoc Pennington <rhp@zirx.pair.com>
- Date: Wed, 9 Jun 1999 21:01:49 -0400 (EDT)
- cc: Mikael Djurfeldt <mdj@mdj-pc.nada.kth.se>, Jim Blandy <jimb@red-bean.com>, Guile Discussion <guile@cygnus.com>
On 9 Jun 1999, Mark Galassi wrote:
>
> Ulrich once talked to me about using a stochastic search technique to
> optimize the *order* of the functions in glibc. Various programs
> would be run, and re-run with a different order of the functions,
> trying to optimize short jumps. A simulated annealing search would
> then guide you to the optimal configuration.
>
> I don't think he's implemented it yet, but it seems like a fun idea.
> Many commercial compilers try to optimize this kind of thing.
>
Nat Friedman (nat@nat.org) has implemented this, it's called "Grope." I
don't know if he has it up for ftp yet though. He gave a talk about it at
Atlanta Linux Showcase last year.
Havoc