Re: Span-Dependent Instructions

preston@libya.rice.edu (Preston Briggs)
Thu, 3 Jan 91 23:18:45 GMT

          From comp.compilers
Related articles
Re: Span-Dependent Instructions preston@libya.rice.edu (1991-01-03)
Re: Span-Dependent Instructions dmr@research.att.com (1991-01-09)
| List of all articles for this month |
Newsgroups: comp.compilers
From: preston@libya.rice.edu (Preston Briggs)
Keywords: assembler, optimize
Organization: Rice University, Houston
References: <9101022304.AA22609@iecc.cambridge.ma.us> <1991Jan3.060915.3641@rice.edu>
Date: Thu, 3 Jan 91 23:18:45 GMT

I wrote:
>Has anyone ever measured the efficacy of any of these algorithms?


and the moderator noted
>[Szymanski's papers have some effectiveness results. His first paper reports
>that in some pile of PDP-11 code, his algorithm shortened considerably more
>branches than the one the assembler used. -John]


Actually, I meant more along the lines of runtime improvements. My personal
speculation is that this whole area is a source of only insignificant
improvements. I could easily be wrong though -- that's why I was wondering
about empirical measurements.


Preston Briggs
--

Post a followup to this message

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