Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries · HackerPapers discussions

Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries — HN submission

Fri, 06 Jun 2025 08:42:04 GMT

Faster remainder by multiplication, with applications to compilers and software

3 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries — HN submission

Thu, 18 Aug 2022 08:25:50 GMT

Faster Remainder by Direct Computation: Applications to Compilers and Libraries

1 point; 1 discussion reply on HN. Paper and source history. A submission is not an endorsement.

Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries — mentioned by nkurz

Fri, 08 Feb 2019 21:33:38 GMT

The Wikipedia article seems to be using slightly different definitions. For the blog post, the actual article gives better definitions: https://arxiv.org/pdf/1902.01961.pdf. I'm one of the co-authors, and I believe that in our case, N is always equal to the maximum bitwidth of the numerator. So for a 32-bit integer, N=32. I'll see if Daniel can add some clarification to the blog post.

Paper and discussion history. A mention is not an endorsement.