|implementation of optimization phase? Books? Papers? email@example.com (Jeffrey Vetter) (1997-08-28)|
|Re: implementation of optimization phase? Books? Papers? firstname.lastname@example.org (1997-08-30)|
|Re: implementation of optimization phase? Books? Papers? danwang@dynamic.CS.Princeton.EDU (Daniel Wang) (1997-08-30)|
|RE: implementation of optimization phase? Books? email@example.com (Joe Hummel) (1997-08-30)|
|Re: implementation of optimization phase? Books? Papers? firstname.lastname@example.org (1997-09-03)|
|Re: implementation of optimization phase? Books? Papers? email@example.com (1997-09-23)|
|From:||Jeffrey Vetter <firstname.lastname@example.org>|
|Date:||28 Aug 1997 00:32:54 -0400|
|Organization:||Georgia Tech; Atlanta|
|Keywords:||optimize, question, comment|
Can you tell me a nice textbook that describes heuristic methods for
compiler optimization? I'm actually trying to build an optimizer for
arbitrarily-sized input syntax trees. I have several cost functions that
relate latency, perturbation, consistency, and frequency. I'm especially
interested in how to represent these costs in the intermediate
representation of the compiler while evaluating the alternative scenarios.
I think I understand the high level stuff, but a lower level description
of which data structs to use as well as how to develop and evaluate
different cost functions would really help.
Can you point me to any existing work? Thanks.
[I'm not aware of any up to date optimization texts. It's all journal
articles and conference papers. -John]
Return to the
Search the comp.compilers archives again.