Optimizing compilers for modern architectures: a dependence-based approach
Optimizing compilers for modern architectures: a dependence-based approach
Hi-index | 0.00 |
Mapping of non-perfectly nested loops onto a multipipelined architecture is considered. Formulas for the delays between the pipeline starting times are obtained. Graph models of programs (data dependence graph, lattice graph, and computation graph) are used.