Related articles |
---|
[7 earlier articles] |
Re: Loop jamming!? cdg@nullstone.com (Christopher Glaeser) (1997-07-22) |
Re: Loop jamming!? n8tm@aol.com (1997-07-27) |
Re: Loop jamming!? genew@netcom.com (1997-07-28) |
Re: Loop jamming!? simmons@nortel.ca (Steve Simmons) (1997-07-29) |
Re: Loop jamming!? schow@nortel.ca (Stanley Chow) (1997-07-31) |
Re: Loop jamming!? jan@fsnif.neuroinformatik.ruhr-uni-bochum.de (Jan Vorbrueggen) (1997-07-31) |
Re: Loop jamming!? cliff.click@Eng.Sun.COM (cliffc) (1997-08-07) |
Re: Loop jamming!? mkent@acm.org (Mike Kent) (1997-08-07) |
Re: Loop jamming!? schow@nortel.ca (Stanley Chow) (1997-08-09) |
From: | cliffc <cliff.click@Eng.Sun.COM> |
Newsgroups: | comp.compilers |
Date: | 7 Aug 1997 15:15:42 -0400 |
Organization: | Sun Microsystems |
References: | 97-07-089 97-07-102 97-07-108 97-07-130 |
Keywords: | optimize |
Stanley Chow wrote:
> Loop jamming will result in a loop that is, in general, slower than
> each of the original loops. The time penalty will depend on many
> factors (including cache size, serial dependency, multiple ALU) and
> in the extreme case, the time penalty can be zero wrt the slower loop.
Actually, it's pretty easy for the jammed loop to run faster than the
slowest loop, if the cache locality is right.
Cliff
--
Cliff Click Compiler Designer and Researcher
cliffc at acm.org JavaSoft
(408) 863-3266 MS UCUP02-302
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.