An efficient algorithm for the run-time parallelization of DOACROSS loops

@inproceedings{Chen1994AnEA,
  title={An efficient algorithm for the run-time parallelization of DOACROSS loops},
  author={Ding-Kai Chen and Josep Torrellas and Pen-Chung Yew},
  booktitle={SC},
  year={1994}
}
While automatic parallelization of loops usually relies on compile-time analysis of data dependences, for some loops the data dependences cannot be determined at compile time. An example is loops accessing arrays with subscripted subscripts. To parallelize these loops, it is necessary to perform run-time analysis. In this paper, we present a new algorithm to parallelize these loops at run time. Our scheme handles any type of data dependence in the loop without requiring any special… CONTINUE READING
Highly Cited
This paper has 50 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 35 extracted citations

fewer than 50 Citations

0510'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 50 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

The Cedar Fortran Project

  • R. Eigenmann, J. Hoe inger, G. Jaxon, D. Padua
  • Technical Report 1262,
  • 1992
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…