exo

You can quite often write C code that compilers will autovectorize into what you want.. if the thing in question is a simple case, or you put in effort into doing the non-trivial aspects yourself. e.g. for the loop reordering example [1] in C you could just, well, manually reorder the loops; and the simple loop would autovectorize to AVX2 just fine. The things that are messy-to-impossible to achieve in current traditional compilers are things where the compiler thinks it does a smart transformation, but it ends up making things worse. [1]: https://github.com/exo-lang/exo/tree/main/examples/avx2_matm...

If you read the actual github, linked from the article, you will realize that it is a manual static scheduler. Example here: https://github.com/exo-lang/exo/blob/main/examples/avx2_matm... The hardware still does what it does, but this is a tool for manually ordering operations. I did, in fact, read the materials before dismissing them as useless, since this is very relevant to what I do professionally.

https://github.com/exo-lang/exo/blob/main/examples/avx2_matm... I personally am not convinced.

> The researchers implemented a scheduling library with roughly 2,000 lines of code in Exo 2, encapsulating reusable optimizations that are linear-algebra specific and target-specific (AVX512, AVX2, Neon, and Gemmini hardware accelerators). This library consolidates scheduling efforts across more than 80 high-performance kernels with up to a dozen lines of code each, delivering performance comparable to, or better than, MKL, OpenBLAS, BLIS, and Halide. exo-lang/exo: https://github.com/exo-lang/exo