PLR is an automatic parallelizer and CUDA code generator for linear recurrences, including prefix sums and 1D digital IIR filters, as described in this ASPLOS paper.
To generate PLR code for a specific recurrence, enter the signature of the recurrence in the text box below and click the submit button. Note that the (generated) PLR code is protected by this license and that by downloading the code you agree to the terms and conditions set forth in this license.
For example, to generate scalar, first-order, integer prefix-sum code, enter the signature "1 : 1" without any quotes or parentheses (note the spaces before and after the colon). Table 1 and the surrounding text in the ASPLOS paper explain how to create the signatures for other recurrences.