MétaCan
Menu
Back to cohort
Record W2095027279 · doi:10.1109/ised.2013.34

Efficient Data Encoding for Improving Fault Simulation Performance on GPUs

2013· article· en· W2095027279 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsÉcole de Technologie SupérieureMcGill University
Fundersnot available
KeywordsComputer scienceParallel computingGraphicsEncoding (memory)Computer architectureKey (lock)Data deduplicationComputationComputer engineeringComputer graphics (images)AlgorithmOperating system

Abstract

fetched live from OpenAlex

Graphics Processing Units (GPUs) have recently gained widespread usage as an advanced parallel platform for accelerating compute intensive applications. One of the key factors for achieving maximal performance of GPU kernels is to ensure that the data used for computation is mapped independently. This implies that data duplication is needed, however, an efficient mapping of data is imperative as the on-board memory capacities on GPUs are limited. In this paper, we present a novel data encoding technique for creating an efficient data mapping for the application of fault simulation algorithms. Fault simulation requires a certain level of data dependency which creates a challenge for efficiently mapping the circuit data on the GPU's device memory. Based on our results, our memory optimization techniques were able to reduce the memory usage by 80% with speed ups reaching over 60× in the circuit benchmarks tested.

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.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.690
Threshold uncertainty score0.297

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.0010.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.042
GPT teacher head0.294
Teacher spread0.252 · 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