Related articles |
---|
Irregular Data Access Pattern Loops on Parallel Machines Mounir.Hahad@irisa.fr (1993-10-05) |
Re: Irregular Data Access Pattern Loops on Parallel Machines preston@dawn.cs.rice.edu (1993-10-13) |
Re: Irregular Data Access Pattern Loops on Parallel Machines moyer@mathcs.emory.edu (1993-10-13) |
Newsgroups: | comp.compilers,comp.parallel |
From: | Mounir.Hahad@irisa.fr (Mounir Hahad) |
Followup-To: | comp.parallel |
Keywords: | parallel, question |
Organization: | Irisa, Rennes(FR) |
Date: | Tue, 5 Oct 1993 13:35:57 GMT |
Hi,
I'm looking for references to articles dealing with the problem of
compiling loops with irregular data access patterns on parallel
computers for minimum communication/maximum locality.
Ex:
DO I=1,N
A(B(I)) = f
ENDDO
where B is not known at compile time.
Thanks in advance.
--
Mounir Hahad e-Mail : hahad@irisa.fr
Tel : +33.99.84.74.14
Fax : +33.99.38.38.32
IRISA/INRIA - Campus de Beaulieu Telex : UNIRISA 950 473F
35042 Rennes cedex - France
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.