MétaCan
Menu
Back to cohort
Record W4409282847 · doi:10.1145/3676536.3676807

A Framework for Explainable, Comprehensive, and Customizable Memory-Centric Workloads

2024· article· en· W4409282847 on OpenAlexaff
Mohamed Abuelala, Mohamed Hassan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsComputer scienceComputer architectureMemory managementOperating systemSemiconductor memory

Abstract

fetched live from OpenAlex

Explainable workloads with analyzable memory traffic patterns are key for accurate performance estimates at early design exploration phase for novel memory solutions. This paper proposes RAMify: a tunable framework for generating explainable memory-centric workloads. By being memory-aware: RAMify offers several tuning knobs enabling the generation of an extensive set of different workloads, each of them is low-level tuned to produce a particular DRAM access pattern. RAMify enables a systematic way to explore and evaluate novel memory subsystem proposals at early design phases, validate their performance, stress their behaviour, and qualitatively compare them against other policies under various memory-aware scenarios to facilitate data-driven design choices. We evaluated with extensive experiments across three different cycle-accurate memory simulators and a full-system multi-core simulator. Results show that using RAMify, we were able to 1) make interesting observations about the comparative behavior of two of the state-of-the-art memory technologies (DDR4 and HBM) that were not possible to make in non memory-centric benchmarks, and 2) We managed to reveal discrepancies in state-of-the-art memory simulator policies and scheduling techniques.

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 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.000
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.867
Threshold uncertainty score0.504

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0000.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.024
GPT teacher head0.290
Teacher spread0.266 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicParallel Computing and Optimization TechniquesFrench-language works237,207