MétaCan
Menu
Back to cohort
Record W1982709980 · doi:10.1109/hldvt.2010.5496655

Automatic generation of host-compiled timed TLMs for high level design

2010· article· en· W1982709980 on OpenAlex
Samar Abdi

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEmbedded Systems Design Techniques
Canadian institutionsConcordia University
FundersUniversity of California, Irvine
KeywordsSystemCComputer scienceTransaction-level modelingHost (biology)Set (abstract data type)Computer architectureInstruction setParallel computingCode (set theory)Electronic system-level design and verificationCode generationEmbedded systemProgramming languageKey (lock)Operating system

Abstract

fetched live from OpenAlex

This paper presents a case for using automatically generated transaction level models (TLMs) for high level design. The inputs to automatic TLM generation are application C tasks mapped to processing units in the platform. Based on the mapping, the basic blocks in the C tasks are analyzed and annotated with estimated delays. The delay-annotated C code is linked with a SystemC model of the platform's communication architecture to generate the TLM. The TLM is compiled and executed natively on the host machine, making it much faster than conventional cycle accurate models. TLMs for industrial scale designs such as MP3 decoder have been shown to simulate in seconds, compared to 3-4 hrs of instruction set simulation (ISS) and 15-18 hrs of RTL simulation. Timing estimation error over board simulation has been shown to be less than 15%.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.465
Threshold uncertainty score0.444

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.096
GPT teacher head0.291
Teacher spread0.195 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations2
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicEmbedded Systems Design TechniquesFrench-language works237,207