#58 enables the simple cost/award estimation for MRRG mapping.
However, it is now super rough and when I try to include the utilization (e.g., lower utilized tile should be prioritized for placement of an operation), the compiled II unfortunately becomes worse.
For now, the simple for loop's RecMII = 4, ResMII = 1, but CompiledII = 6: https://github.com/coredac/dataflow/blob/3a3c5546a7b6c0cf2bbef7692474a8570a2b6922/test/neura/ctrl/branch_for.mlir#L141
Our goal is to decrease CompiledII from 6 to 4. Note that the pattern matching is orthogonal, which can make RecMII = 1 hopefully.
TODO:
#58 enables the simple cost/award estimation for MRRG mapping.
However, it is now super rough and when I try to include the utilization (e.g., lower utilized tile should be prioritized for placement of an operation), the compiled II unfortunately becomes worse.
For now, the simple for loop's
RecMII = 4,ResMII = 1, butCompiledII = 6: https://github.com/coredac/dataflow/blob/3a3c5546a7b6c0cf2bbef7692474a8570a2b6922/test/neura/ctrl/branch_for.mlir#L141Our goal is to decrease
CompiledIIfrom 6 to 4. Note that the pattern matching is orthogonal, which can makeRecMII = 1hopefully.TODO: