Re: Jump size optimization info...

Ken Rose <kenrose@nc-sys.com>
11 Jan 2007 18:34:36 -0500

          From comp.compilers
Related articles
Jump size optimization info... Orlando.Llanes@gmail.com (Orlando Llanes) (2007-01-08)
Re: Jump size optimization info... kenrose@nc-sys.com (Ken Rose) (2007-01-11)
Re: Jump size optimization info... sdn@svpal.org (Steven Nichols) (2007-01-12)
Re: Jump size optimization info... sdn@svpal.org (Steven Nichols) (2007-01-12)
Re: Jump size optimization info... anton@mips.complang.tuwien.ac.at (2007-01-12)
Re: Jump size optimization info... gah@ugcs.caltech.edu (glen herrmannsfeldt) (2007-01-14)
Re: Jump size optimization info... 148f3wg02@sneakemail.com (Karsten Nyblad) (2007-01-28)
Re: Jump size optimization info... niktechc@niktech.com (Sandeep Dutta) (2007-01-31)
[1 later articles]
| List of all articles for this month |
From: Ken Rose <kenrose@nc-sys.com>
Newsgroups: comp.compilers
Date: 11 Jan 2007 18:34:36 -0500
Organization: Compilers Central
References: 07-01-023
Keywords: optimize, bibliography
Posted-Date: 11 Jan 2007 18:34:36 EST

> [There was a paper by Tom Szymanski in the CACM in the 1970s that
> explained how to calculate branch sizes. The general problem is
> NP-complete, but as is usually the case with NP-complete problems,
> there is simple algorithm that gets you very close to the optimal
> result. -John]


Do you have a citation for that? I searched through the CACM archive,
and I couldn't find anything by that author, not even with the
dubious-looking double "y" removed.


Thanks


    - ken
[Sorry, now it's spelled right. This question came 15 years ago. See
http://compilers.iecc.com/comparch/article/91-01-005 -John]


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.