This is the mail archive of the
guile@cygnus.com
mailing list for the Guile project.
Re: Well, that's interesting.
- To: Havoc Pennington <rhp@zirx.pair.com>
- Subject: Re: Well, that's interesting.
- From: Lynn Winebarger <owinebar@indiana.edu>
- Date: Thu, 10 Jun 1999 00:00:11 -0500 (EST)
- cc: Mark Galassi <rosalia@lanl.gov>, Mikael Djurfeldt <mdj@mdj-pc.nada.kth.se>, Jim Blandy <jimb@red-bean.com>, Guile Discussion <guile@cygnus.com>
On Wed, 9 Jun 1999, Havoc Pennington wrote:
> 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.
This sort of thing would best be in the dynamic linker, not the
compiler. It would be in a position to dynamically adjust it as the need
arose, rather than attempting to do statically what is an inherently
dynamic optimization.
Lynn