|Irregular Data Access Pattern Loops on Parallel Machines Mounir.Hahad@irisa.fr (1993-10-05)|
|Re: Irregular Data Access Pattern Loops on Parallel Machines firstname.lastname@example.org (1993-10-13)|
|Re: Irregular Data Access Pattern Loops on Parallel Machines email@example.com (1993-10-13)|
|From:||firstname.lastname@example.org (Steve Moyer)|
|Organization:||Emory University, Dept of Math and CS|
|Date:||Wed, 13 Oct 1993 12:33:10 GMT|
In article 93-10-060,
Preston Briggs <email@example.com> wrote:
>The common current approach is to use some sort of "inspector/executer"
>code at run time.
>I don't know that people are able to insert all this
>inspector/executer code at compile time, but Joel Saltz has done a fair
>amount of work on subroutines to support irregular computations of this
>sort on distributed memory machines. Perhaps someone else will know the
>references. I believe the package is called PARTI.
Saltz, J., Crowley, K., Mirchandaney, R., Berryman, H., "Run-Time Scheduling
and Execution of Loops on Message Passing Machines", Journal of Parallel
and Distributed Computing, April 1990.
Emory University, Atlanta, GA
Internet: firstname.lastname@example.org BITNET: email@example.com
Return to the
Search the comp.compilers archives again.