Loop tiling and loop ordering in MLIR

[SUYASH BAKSHI]

Hello, I'm relatively new to understanding MLIR and its use cases. I'm interested in learning about the passes in MLIR in the context of optimizations for dense matrix/dense linear algebra operations. More specifically the LoopTiling pass.

I see here, in the comment on line#88, that loop tiling sizes in MLIR are determined based on the fact whether the tiles "fit" in the memory or not. However, there are several frameworks such as TVM, Timeloop, dMazeRunner etc. that have shown loop tiling (and loop ordering) to be a complicated problem. There are several factors affecting best tiling and ordering strategy for running loop-nests for dense arrays on hardware architecture such as levels of memory hierarchy, memory sizes, number of PEs, ranges of each of the loop dimensions etc. And several frameworks have proposed different search algorithms to find the best tiling and ordering for loop-nests on dense arrays.

My question is, does MLIR implements any sophisticated method to perform loop-nests optimization (that I may have missed)? Or is this not the scope of work for MLIR?

I'd appreciate any help regarding this.

Thanks in advance

Suyash

[Jacques Pienaar]

Hey Suyash,

Most of the discussions around MLIR core have moved to 

https://discourse.llvm.org/c/mlir/31 and I think this would be an interesting discussion for many there if you wouldn't mind repeating the question there.

Thanks,

Jacques 

--
You received this message because you are subscribed to the Google Groups "MLIR" group.
To unsubscribe from this group and stop receiving emails from it, send an email to mlir+uns...@tensorflow.org.
To view this discussion on the web visit https://groups.google.com/a/tensorflow.org/d/msgid/mlir/1a7163d4-5fcd-4a6a-81a7-735990e86c3en%40tensorflow.org.

[SUYASH BAKSHI]

Thanks Jacques, I will do that.