MétaCan
Menu
Back to cohort

Coherency overhead of Processing-in-Memory in the presence of shared data

2020· article· en· W3017135028 on OpenAlexaff
Ryan Fife, Ifiok Udoh, Paulo Garcia

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Memory and Neural Computing
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer scienceInterleavingOverhead (engineering)Latency (audio)Data accessUniform memory accessEmbedded systemParallel computingComputer architectureDistributed computingMemory managementComputer hardwareSemiconductor memoryOperating systemDatabase

Abstract

fetched live from OpenAlex

Processing-in-Memory (PIM) architectures are an instance of Near-Data Processing (NDP) that promise to bridge the power-and performance-walls caused by the high latency and power costs associated with external memory access. PIM systems can minimize data transfers to and from processor/memory, relegating (parts of) processing to memory. However, the effects of processor (s)/PIM-systems shared access to data on coherency overhead are not yet understood. In this manuscript, we model coherency overhead of shared data access by processor and PIM systems: i.e., shared access to common data. We present an analytical model that quantifies performance in function of degree of interleaving and PIM system latencies. We evaluate our model using simple image processing kernels, and experimentally validate our approach using PIMSIM, an open-source PIM simulator. Results show that our analytical model can predict coherency overhead within 2% of error margin, and we identify several interesting behaviors that warrant further research towards widespread adoption of PIM.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.509
Threshold uncertainty score0.165

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.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.081
GPT teacher head0.288
Teacher spread0.207 · 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 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

Citations0
Published2020
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Memory and Neural ComputingFrench-language works237,207