Pith. sign in

REVIEW 2 cited by

Rewriting History: Repurposing Domain-Specific CGRAs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.09112 v1 pith:QNK7JHBG submitted 2023-09-16 cs.PL cs.AR

classification cs.PLcs.AR
keywords cgrasflexckernelscgradomain-specificloopoperationsrewriting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Coarse-grained reconfigurable arrays (CGRAs) are domain-specific devices promising both the flexibility of FPGAs and the performance of ASICs. However, with restricted domains comes a danger: designing chips that cannot accelerate enough current and future software to justify the hardware cost. We introduce FlexC, the first flexible CGRA compiler, which allows CGRAs to be adapted to operations they do not natively support. FlexC uses dataflow rewriting, replacing unsupported regions of code with equivalent operations that are supported by the CGRA. We use equality saturation, a technique enabling efficient exploration of a large space of rewrite rules, to effectively search through the program-space for supported programs. We applied FlexC to over 2,000 loop kernels, compiling to four different research CGRAs and 300 generated CGRAs and demonstrate a 2.2$\times$ increase in the number of loop kernels accelerated leading to 3$\times$ speedup compared to an Arm A5 CPU on kernels that would otherwise be unsupported by the accelerator.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Re-thinking Memory-Bound Limitations in CGRAs

    cs.AR 2025-08 conditional novelty 6.0 of 10

    Adding a cache hierarchy, CGRA-specific runahead prefetching, and per-PE cache reconfiguration allows CGRAs to process irregular memory-access kernels at near-ideal speed with 1.27% of the storage.

  2. HEC: Equivalence Verification Checking for Code Transformation via Equality Saturation

    cs.AR 2025-06 conditional novelty 6.0 of 10

    HEC verifies MLIR program equivalence after control-flow and datapath transformations using hybrid static and dynamic e-graph rewriting, and flags two mlir-opt transformation bugs.

Pith tools