|tiling irregular array accesses firstname.lastname@example.org (shrey) (2005-10-08)|
|Re: tiling irregular array accesses email@example.com (Jeff Kenton) (2005-10-13)|
|Re: tiling irregular array accesses mstrout@CS.ColoState.EDU (Michelle Strout) (2005-10-14)|
|Date:||8 Oct 2005 21:09:24 -0400|
|Keywords:||parallel, storage, question|
|Posted-Date:||08 Oct 2005 21:09:24 EDT|
I am wondering if any tiling technique exists which can tile a
perfectly nested loop with both regular and indexed array expressions.
I understand perfectly how the tiling example works for simple matrix
multiplication or how it is done (bucket tiling etc) for an statement
with indexed array accesses on the LHS (Sum += A[x[i]]).But how do u
go abt finding commmon tile sizes satisfying two statements one with
regular access and the other with indexed array access.
Any pointers to textbooks, literature on this would be appreciated.
Return to the
Search the comp.compilers archives again.