MétaCan
Menu
Back to cohort
Record W2907067508 · doi:10.1145/3240302.3240417

Data-driven spatial locality

2018· article· en· W2907067508 on OpenAlexaff
Svetozar Miučin, Alexandra Fedorova

Bibliographic record

VenueProceedings of the International Symposium on Memory Systems · 2018
Typearticle
Languageen
FieldComputer Science
TopicGraph Theory and Algorithms
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsLocalityComputer scienceLocality of referenceCacheSpatial analysisBandwidth (computing)DatabaseParallel computingComputer networkGeography

Abstract

fetched live from OpenAlex

Researchers and practitioners dedicate a lot of effort to improving spatial locality in their programs. Hardware caches rely on spatial locality for efficient operation; when it is absent, they waste memory bandwidth and cache space by fetching data that is never used before it is evicted. Improving spatial locality is difficult. For the most part, these are manual efforts by expert programmers, requiring substantial insight into the program's data layout and data access pattern.

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.002
metaresearch head score (Gemma)0.010
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.010
Threshold uncertainty score0.035

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.010
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0010.002
Scholarly communication0.0020.007
Open science0.0030.005
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0100.003

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.024
GPT teacher head0.256
Teacher spread0.232 · 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

Citations7
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the International Symposium on Memory SystemsSame topicGraph Theory and AlgorithmsFrench-language works237,207