MétaCan
Menu
Back to cohort
Record W1980587820 · doi:10.1109/iscas.2010.5537940

A framework for fast design space exploration using fuzzy search for VLSI computing Architectures

2010· article· en· W1980587820 on OpenAlex

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 institutionsToronto Metropolitan University
Fundersnot available
KeywordsDesign space explorationVery-large-scale integrationSpeedupComputer scienceModular designComputer architectureProcess (computing)Space explorationArchitectureFuzzy logicParallel computingComputer engineeringEmbedded systemArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

In High level Synthesis design methodology, the evaluation and selection of the optimal architecture for the system is done through a process called Design Space Exploration (DSE). This paper presents a novel framework for fast DSE using fuzzy search technique for optimizing modular computing architecture for the current generation of multi objective VLSI designs. The proposed method is able to radically reduce the number of architectural variants to be analyzed during design space exploration while simultaneously maintaining the precision required during the exploration process. Significant improvement in speedup during DSE is obtained for different benchmarks, compared to a DSE method with binary search mechanism.

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.002
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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.597
Threshold uncertainty score0.759

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.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.110
GPT teacher head0.360
Teacher spread0.250 · 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

Citations24
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicEmbedded Systems Design TechniquesFrench-language works237,207