Displaying 3 results from an estimated 3 matches for "offilne".
2020 Feb 06
2
Writing loop transformations on the right representation is more productive
...; trees are essential for a loop optimizer, and that this essential
> nature “justifies” the cost of reinventing an entire compiler
> infrastructure is lower than the benefit of using (e.g.) MLIR to do
> this. I haven’t seen evidence of either point:
Michael and I have discussed this offilne, and I think that more
quantitative information here would be helpful. One phrasing might be:
For a reasonable test suite of programs, for the loops we might
optimize, how many different loop-nest variants do we need to represent
for costing purposes (also note that, depending on profiling info...
2020 Feb 08
2
Writing loop transformations on the right representation is more productive
...ng
transformations, I think organizing the transformations in code is
sufficient at the beginning. Since transformations apply on subtrees, are
prioritized, and can add candidates to be selected by a cost function, a
pass manager has to be structured differently.
Michael and I have discussed this offilne, and I think that more
> quantitative information here would be helpful. One phrasing might be: For
> a reasonable test suite of programs, for the loops we might optimize, how
> many different loop-nest variants do we need to represent for costing
> purposes (also note that, depending o...
2020 Feb 03
5
Writing loop transformations on the right representation is more productive
Am Do., 30. Jan. 2020 um 04:40 Uhr schrieb Uday Kumar Reddy Bondhugula
<uday at polymagelabs.com>:
> There are multiple ways regions in MLIR can be viewed, but the more relevant point here is you do have a loop tree structure native in the IR with MLIR. Regions in MLIR didn't evolve from modeling inlined calls - the affine.for/affine.if were originally the only two operations in MLIR