questions about tiramisu capabilities about tiramisu

[rbaghdadi]

Hi,

Yes Tiramisu can generate code that has array access bounds parametrized by function arguments. The loop bounds in Tiramisu can be any expression (as long as the loop bound is invariant to the loop body).

Generating the same schedule of gemm written by hand is still not supported in the autoscheduler. That schedule needs a much larger search space.

[rohany]

Yes Tiramisu can generate code that has array access bounds parametrized by function arguments. The loop bounds in Tiramisu can be any expression (as long as the loop bound is invariant to the loop body).

Can you point me to some example code that does this?

Generating the same schedule of gemm written by hand is still not supported in the autoscheduler. That schedule needs a much larger search space.

Makes sense. I would be planning to use it on non-blas kernels though, so is the expected performance good in those cases?

[rbaghdadi]

Yes, there is an example in the GEMM benchmark. The sizes are passed in SIZES and then used to initialize N, M and K: https://github.com/Tiramisu-Compiler/tiramisu/blob/master/benchmarks/linear_algebra/blas/level3/sgemm/cpu/sgemm_generator.cpp

For the autoscheduler, I think the only way to tell is to actually try it. We would be happy to learn about the results! In general, the closer the code is to randomly codes that we generate and the closer your hardware is to our hardware the more accurate the cost model is (this cost model was not trained for multiple hardware machines). We did our training on this cluster: http://groups.csail.mit.edu/commit/lanka/