Thread

1. bee_rider · 1789619482 · focus · HN ↗

   The algebraic manipulation that you use to break the dependency seems to be specific to the matrix being Poisson on a finite-difference grid (is that right?). In that case wouldn’t it make more sense to compare against specialized Poisson solvers?

   1. loiseaujc · 1789628696 · focus · HN ↗

      Author here. It is indeed specific to this 2D Poisson matrix, although loop-unrolling + substitution is a very general technique in performance engineering. Eventually, whenever I'm done teaching classes, we'll get to specialized sparse matrix solvers for this problem and we'll see they come with their own set of problems (and loop carried dependencies are definitely one of them).

      In any case, the idea behind this series on Jacobi (this is like the 4th post I believe) is to help students (and people interested in scientific computing in general) get what actually matters computationally and lift the hood to get some understanding of the interplay between such algorithms and their actual implementation on hardware.

Unofficial Hacker News client; not affiliated with Y Combinator.