loopy
loopy copied to clipboard
generate_loop_schedule_v2
Implementation for finding loop nest around map in O(N.k), 'N' being the number of inames and 'k' being the max. loop depth.
For comparison, let's consider the kernel in #288: on main
this map in computed in 5 minutes and this branch takes 30 0.4 seconds.
Does #372 supersede this?
@inducer: Not really. #372 includes commits from this branch, so that I could do some tests on my test problems. But I propose we merge them separately. (I've updated the description of #372 to record that)
I was just rebasing this. You beat me to it! :)
Unsubscribing... @-mention or request review once it's ready for a look or needs attention.
But I'm eager to get this in soon!