3 ms·

One context in which diophantine equations arise is hidden within the innards of loop optimizing compilers, where loop carried dependencies are considered, as t

One context in which diophantine equations arise is hidden within the innards of loop optimizing compilers, where loop carried dependencies are considered, as they constrain parallelization. I had (and donated to an engineering library in Urbana) a book about just this from the early 90s. I tried finding it on Amazon but no such luck. This was a recurrent tool at https://en.wikipedia.org/wiki/University_of_Illinois_Center_for_Supercomputing_Research_and_Development https://en.wikipedia.org/wiki/University_of_Illinois_Center_...

dheera 3mo ago
Probably in the future nobody will be able to figure out how these things are written, because studying math doesn't make as much money as vibe coding.
- jjtheblunt 3mo ago
  Yeah it most definitely can. That said, you have a good point, in terms of how often it can.
boarsofcanada 3mo ago
Perhaps you’re referring to one of Utpal Banerjee’s books? https://www.thriftbooks.com/a/utpal-banerjee/1265627/?srsltid=AfmBOop2orLI8oShtulqTnavDdp5c6WwMUTTnA6MNFygZqUXeHmWNuJa https://www.thriftbooks.com/a/utpal-banerjee/1265627/?srslti... I owned a few of them along with Michael Wolfe’s book, Allen & Kennedy, etc when I was working in this space.
- jjtheblunt 3mo ago
  Yes, those are the ones we had. Wolfe had graduated before i was there.
mathisfun123 3mo ago
Hn upvotes the weirdest things. You're talking about polyhedral analysis which emphatically does not work on diophantine forms http://polyhedral.info/ http://polyhedral.info/
- jjtheblunt 3mo ago
  Check the link above...it seems we're considering different topics. Most often these analyses were framed in terms of integer indices on multidimensional arrays in Fortran loops, though that was just the common format academics all knew, as i recall. Personally I'd started with C (and x86 assembly and Basic on Apple ][ and Atari 800) so was a younger vintage.
- srean 3mo ago
  What's with this phenomenon of new accounts that confidently make authoritative false claims in things that they have no competence in. Few days ago there was this account claiming there's no rotation matrices to be seen in any ML algorithms. EDIT: oh it's the same guy. LoL.
  - mathisfun123 3mo ago
    > March 9, 2023 This is a new account? > no competence in. I have a PhD in ML compilers (one of my papers is cited on the site I linked) and as I mentioned in the previous "discussion" I currently work in FAANG as an ML compiler engineer. But thanks for playing :)
    - srean 3mo ago
      That was my guess anyhow. A common affliction among newly minted PhDs. They usually out grow it. I am reminded of https://news.ycombinator.com/user?id=almostgotcaught https://news.ycombinator.com/user?id=almostgotcaught Won't be surprised if it's the same person. FAANG are now in the midst of a hype cycle. So that place of employment signal is pretty noisy now, especially if employed in the hyped field. Coming back to the point, Polyhedral models for loop analysis and Diophantine equation based address aliasing analysis are quite different techniques.
      - deleted 3mo ago
        [deleted]
    - jjtheblunt 3mo ago

dheera 3mo ago

Probably in the future nobody will be able to figure out how these things are written, because studying math doesn't make as much money as vibe coding.

jjtheblunt 3mo ago
Yeah it most definitely can. That said, you have a good point, in terms of how often it can.

boarsofcanada 3mo ago

Perhaps you’re referring to one of Utpal Banerjee’s books? https://www.thriftbooks.com/a/utpal-banerjee/1265627/?srsltid=AfmBOop2orLI8oShtulqTnavDdp5c6WwMUTTnA6MNFygZqUXeHmWNuJa https://www.thriftbooks.com/a/utpal-banerjee/1265627/?srslti... I owned a few of them along with Michael Wolfe’s book, Allen & Kennedy, etc when I was working in this space.

jjtheblunt 3mo ago
Yes, those are the ones we had. Wolfe had graduated before i was there.

mathisfun123 3mo ago

Hn upvotes the weirdest things. You're talking about polyhedral analysis which emphatically does not work on diophantine forms http://polyhedral.info/ http://polyhedral.info/

jjtheblunt 3mo ago
Check the link above...it seems we're considering different topics. Most often these analyses were framed in terms of integer indices on multidimensional arrays in Fortran loops, though that was just the common format academics all knew, as i recall. Personally I'd started with C (and x86 assembly and Basic on Apple ][ and Atari 800) so was a younger vintage.
srean 3mo ago
What's with this phenomenon of new accounts that confidently make authoritative false claims in things that they have no competence in. Few days ago there was this account claiming there's no rotation matrices to be seen in any ML algorithms. EDIT: oh it's the same guy. LoL.
- mathisfun123 3mo ago
  > March 9, 2023 This is a new account? > no competence in. I have a PhD in ML compilers (one of my papers is cited on the site I linked) and as I mentioned in the previous "discussion" I currently work in FAANG as an ML compiler engineer. But thanks for playing :)
  - srean 3mo ago
    That was my guess anyhow. A common affliction among newly minted PhDs. They usually out grow it. I am reminded of https://news.ycombinator.com/user?id=almostgotcaught https://news.ycombinator.com/user?id=almostgotcaught Won't be surprised if it's the same person. FAANG are now in the midst of a hype cycle. So that place of employment signal is pretty noisy now, especially if employed in the hyped field. Coming back to the point, Polyhedral models for loop analysis and Diophantine equation based address aliasing analysis are quite different techniques.
    - deleted 3mo ago
      [deleted]
  - jjtheblunt 3mo ago