MétaCan
Menu
Back to cohort
Record W2032204694 · doi:10.1109/mm.2006.26

Unbounded Transactional Memory

2006· article· en· W2032204694 on OpenAlexaff
C. Scott Ananian, Krste Asanović, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie

Bibliographic record

VenueIEEE Micro · 2006
Typearticle
Languageen
FieldComputer Science
TopicDistributed systems and fault tolerance
Canadian institutionsAdvanced Micro Devices (Canada)
Fundersnot available
KeywordsComputer scienceTransactional memoryMemory footprintTransactional leadershipSoftware transactional memoryCorrectnessTransaction processingMemory managementArchitectureDatabase transactionDistributed computingParallel computingOperating systemDatabaseOverlayProgramming language

Abstract

fetched live from OpenAlex

Transactional memory should be virtualized to support transactions of arbitrary footprint and duration. The unbounded transactional memory (UTM) architecture achieves high performance in the common case of small transactions, without sacrificing correctness in large transactions.

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.006
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.013
Threshold uncertainty score0.044

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0030.007
Open science0.0030.003
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0130.006

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.007
GPT teacher head0.205
Teacher spread0.198 · 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

Citations158
Published2006
Admission routes1
Has abstractyes

Explore more

Same venueIEEE MicroSame topicDistributed systems and fault toleranceFrench-language works237,207