Heuristics for Routing and Spiral Run-time Task Mapping in NoC-based\n Heterogeneous MPSOCs
Bibliographic record
Abstract
This paper describes a new Spiral Dynamic Task Mapping heuristic for mapping\napplications onto NoC-based Heterogeneous MPSoC. The heuristic proposed in this\npaper attempts to map the tasks of an applications that are most related to\neach other in spiral manner and to find the best possible path load that\nminimizes the communication overhead. In this context, we have realized a\nsimulation environment for experimental evaluations to map applications with\nvarying number of tasks onto an 8x8 NoC-based Heterogeneous MPSoCs platform, we\ndemonstrate that the new mapping heuristics with the new modified dijkstra\nrouting algorithm proposed are capable of reducing the total execution time and\nenergy consumption of applications when compared to state-of the-art run-time\nmapping heuristics reported in the literature.\n
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.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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".