Reuse-Aware Partitioning of Dataflow Graphs on a Tightly-Coupled CGRA
Bibliographic record
Abstract
We formulate a solution for the temporal partitioning of dataflow graphs (DFGs) on a coarse-grain reconfigurable array (CGRA) accelerator that is tightly coupled to system memory. The tight coupling gives rise to partitioning concerns that have not been considered in prior work. Specifically, multiple load nodes in a DFG may receive data on the same cache line, i.e., exhibit cache line reuse. Constraining such nodes to the same partition may (but not necessarily) reduce the number of memory transactions. Further, it is necessary to quantify interpartition communication by the number of memory transactions as opposed to the number of edges that cross partitions. Finally, the target CGRA accelerator imposes a limit on the number of concurrent memory transactions; a limit that must be observed. Temporal partitioning is formulated as a 01-ILP model that captures these concerns. Evaluation using 9 representative DFGs shows that: (1) the model is efficient to solve; (2) there is benefit to considering cache line reuse-memory communication cost reduces by 11% on average and by up to 20%, with a commensurate improvement in DFG throughput by 28% on average and by up to 70%; (3) the use of the number of memory transactions to quantify communication as opposed to DFG edges can reduce the number of partitions; and (4) imposing the memory transactions limit does not adversely impact the partitioning. Thus, the 01-ILP model is effective in capturing the concerns that arise and evaluation demonstrates the value of addressing these concerns.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".