MétaCan
Menu
Back to cohort
Record W2195788284

On instruction organization

2015· article· en· W2195788284 on OpenAlexaff
Tyler Dwyer, Alexandra Fedorova

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsComputer scienceTask (project management)LocalityLatency (audio)Program codeCode (set theory)Programming languageSoftware engineering
DOInot available

Abstract

fetched live from OpenAlex

To attain high program performance, a developer must be conscious to the many intricacies of hardware and or-ganize their code accordingly. This however, is not an easy task. Often the hardware is unknown to develop-ers, or, if it is known, it is difficult to control or ac-count for. Developers struggle with this challenge by using hardware conscious algorithms, specialized pro-gramming languages, or doing manual low-level opti-mizations. We investigate the concept of instruction organization at a more general level. In particular, we investigate if a program, running on existing hardware, can be auto-matically reorganized according to a chosen organiza-tion metric. Further, if the reorganization can be done automatically, a program can then be reorganized during execution to adapt to changes in system resources, and changing execution and data access patterns. We use data locality as an organization metric with the goal of reducing data access latency and improving program performance. 1

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.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.027

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.002
Science and technology studies0.0010.002
Scholarly communication0.0020.005
Open science0.0020.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0080.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.020
GPT teacher head0.243
Teacher spread0.224 · 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 designTheoretical or conceptual
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

Citations0
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicParallel Computing and Optimization TechniquesFrench-language works237,207