MétaCan
Menu
Back to cohort
Record W2010948088 · doi:10.1145/2641361.2641377

The Ultrasmall soft processor

2013· article· en· W2010948088 on OpenAlexaboutno aff
Yuichiroh Tanaka, Shimpei Sato, Kenji Kise

Bibliographic record

VenueACM SIGARCH Computer Architecture News · 2013
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsnot available
Fundersnot available
KeywordsField-programmable gate arrayComputer scienceEmbedded systemImplementationKey (lock)Multi-core processorProcessor designComputer architectureComputer hardwareCore (optical fiber)Parallel computingOperating systemTelecommunicationsSoftware engineering

Abstract

fetched live from OpenAlex

A soft processor is a processor that is implemented using logic synthesis mainly targeting programmable logic device like FPGA and it becomes a common component for FPGA designs. The supersmall soft processor (small-core) developed at University of Toronto is an unique soft processor because its main concern is very low hardware cost while supporting 32-bit ISA. With the same concept as small-core, we are developing the ultrasmall soft processor (UltraSmall) based on smallcore. The goal of this project is to implement the smallest 32-bit ISA soft processor while aiming to achieve high performance. We propose UltraSmall and describe its key ideas and implementations. The evaluation results indicate that the hardware cost of UltraSmall is smaller than smallcore in the latest FPGA while achieving 1.8x performance of small-core.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.011
Threshold uncertainty score0.038

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0110.002

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.010
GPT teacher head0.236
Teacher spread0.226 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations3
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueACM SIGARCH Computer Architecture NewsSame topicParallel Computing and Optimization TechniquesFrench-language works237,207