Halide Talk
Andrew Adams · 3 位 HN 用户推荐 · 2014–2018
You can see it a little bit in the blur example on the front page: the blur algorithm is described in two lines and the optimizations are described separately in the "schedule" below. In this case the schedule specifies that intermediate results should be computed in tiles of a certain size, and the whole thing is both vectorized and parallelized. The best way to understand it is probably to watc
— modeless, 2014Off-topic: the "Halide Talk" video in that page was very good: [link]
— test9753, 2017A really nice video with animations of various scheduling approaches for these types of linear algebra algorithms: [link]
— tehsauce, 2018