|
|
|
|
|
|
by Verdex_2
3307 days ago
|
|
|
I'm not sure, but I remember seeing some research into using it for Haskell stream fusion (can't find the video, sorry). I believe that the basic idea was that not all rewrites end up being equally fast ( a * b * c can be fused into ab * c, but maybe a * bc is faster). Trying all the combinations is an option in theory, but you get a combinatorial explosion so you normally dont get far in practice. Enter machine learning. I'm not sure how successful they were, but I imagine that the same sort of thing could be applied to SIMD. |
|
|