| Related articles |
|---|
| Loop jamming!? wjhung@csie.nctu.edu.tw (1997-06-24) |
| Re: Loop jamming!? simmons@nortel.ca (Steve Simmons) (1997-06-30) |
| Re: Loop jamming!? joelw@rsn.hp.com (Joel Williamson) (1997-06-30) |
| Re: Loop jamming!? sven@customized.com (Sven) (1997-07-13) |
| Re: Loop jamming!? n8tm@aol.com (1997-07-16) |
| Re: Loop jamming!? cdg@nullstone.com (Christopher Glaeser) (1997-07-18) |
| Re: Loop jamming!? schow@nortel.ca (Stanley Chow) (1997-07-21) |
| Re: Loop jamming!? cdg@nullstone.com (Christopher Glaeser) (1997-07-22) |
| Re: Loop jamming!? n8tm@aol.com (1997-07-27) |
| [7 later articles] |
| From: | Joel Williamson <joelw@rsn.hp.com> |
| Newsgroups: | comp.compilers |
| Date: | 30 Jun 1997 22:52:52 -0400 |
| Organization: | Hewlett Packard/Convex |
| References: | 97-06-089 |
| Keywords: | optimize |
> Is there anyone that understands the keyword "loop jamming".
Loop-jamming is often used as a synonym for loop-fusion:
do i = 1, n
a(i) = b(i) + c(i)
enddo
do i = 1, n
e(i) = f(i) + g(i)
enddo
becomes:
do i = 1, n
a(i) = b(i) + c(i)
e(i) = f(i) + g(i)
enddo
Often used to jam many congruent Fortran 90 array assignment statements
into one loop to reduce loop overhead, where doing so does not introduce
any loop-carried-dependences.
Best regards,
Joel Williamson
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.