home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!rpi!usenet.coe.montana.edu!news.u.washington.edu!ogicse!das-news.harvard.edu!spdcc!iecc!compilers-sender
- From: jeremy@sw.oz.au (Jeremy Fitzhardinge)
- Newsgroups: comp.compilers
- Subject: Code Generation by Coagulation?
- Summary: Has anyone used Code Generation by Coagulation?
- Keywords: code, optimize
- Message-ID: <92-08-051@comp.compilers>
- Date: 12 Aug 92 09:27:45 GMT
- Article-I.D.: comp.92-08-051
- Sender: compilers-sender@iecc.cambridge.ma.us
- Reply-To: jeremy@sw.oz.au (Jeremy Fitzhardinge)
- Organization: Softway Pty Ltd
- Lines: 23
- Approved: compilers@iecc.cambridge.ma.us
-
- I've been looking through the paper "Code Generation by Coagualtion" by
- Michael Karr, published in 1984. In it, a code generation algorithm is
- describes that does instruction selection simultaneously with register
- allocation. The code generator has access to runtime flow statistics, and
- it generates code for most critical blocks first to least critical last.
- It also generates linkage code between them so that most common flow paths
- have optimial interfaces.
-
- It all looks quite interesting, but the conclusion says that none of the
- ideas has been implemented, so whether it is a good idea is entirely
- hypothetical. I'm wondering if this work has been followed up or further
- investigated. I'm looking for papers, actual code etc..
-
- Thanks,
- J
-
- --
- jeremy@softway.sw.oz.au ph:+61 2 698 2322-x122 fax:+61 2 699 9174
- [Someone asked a similar question in 1987 but there weren't any answers.
- -John]
- --
- Send compilers articles to compilers@iecc.cambridge.ma.us or
- {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.
-