A. Darte, Y. Robert, and F. Vivien. Loop parallelization algorithms. In Compiler Optimizations for Scalable Parallel Systems Languages, pages 141--172, 2001. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
An Efficient Scheduling of Uniform Dependence Loops - Andronikos Kalathas Ciorba (2003) (Correct)
....are not just vertices of the graph, but they have coordinates in this cartesian space. Furthermore, the precedence (dependence) constraints are represented by a fixed and uniform set of dependence vectors which is the same throughout the index space, simplifying things even more. Darte et al. [4] made a survey of various parallelism detection algorithms, but all of them take a different description of data dependencies (such as graph description, dependence levels) unlike the approach of set of dependence vectors of a cartesian space that we also use. These algorithms use various ....
A. Darte, Y. Robert, and F. Vivien. Loop parallelization algorithms. In Compiler Optimizations for Scalable Parallel Systems Languages, pages 141--172, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC