Re: Irregular Data Access Pattern Loops on Parallel Machines

moyer@mathcs.emory.edu (Steve Moyer)
Wed, 13 Oct 1993 12:33:10 GMT

          From comp.compilers
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)
| List of all articles for this month |
Newsgroups: comp.compilers
From: moyer@mathcs.emory.edu (Steve Moyer)
Keywords: parallel
Organization: Emory University, Dept of Math and CS
References: 93-10-031 93-10-060
Date: Wed, 13 Oct 1993 12:33:10 GMT

In article 93-10-060,
Preston Briggs <preston@dawn.cs.rice.edu> 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.


Steven Moyer
--
Steve Moyer
Emory University, Atlanta, GA
Internet: moyer@mathcs.emory.edu BITNET: moyer@emory.bitnet
UUCP: {rutgers,gatech}!emory!moyer
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.