MétaCan
Menu
Back to cohort
Record W2547356383 · doi:10.1109/ccece.2016.7726758

Write improvement strategies for serial NOR dataflash memory

2016· article· en· W2547356383 on OpenAlex
Scott Fazackerley, Wade Penson, Ramon Lawrence

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
TopicAdvanced Data Storage Technologies
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceSerial communicationEmbedded systemEfficient energy usePower (physics)Consistency (knowledge bases)Data consistencyEnergy (signal processing)Computer hardwareDatabaseElectrical engineeringArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

Embedded systems are ubiquitous and perform tasks such as data logging and monitoring. For these devices, lifetime, power use, and data consistency are critical. Systems require robust and energy efficient storage strategies. Serial NOR Dataflash is commonly used, but suffers from high write and erase times as well as limited lifetime. This work proposes write strategies for serial NOR Dataflash that improves efficiency and power use, and decreases write times. Experimental results demonstrate that using masked overwriting strategies can improve write times by an order of magnitude and reduce the number of required page erases, reduce energy consumed by writing and reduce data transfers by up to 90% for specific applications.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.406
Threshold uncertainty score0.335

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.002
Open science0.0010.001
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.022
GPT teacher head0.267
Teacher spread0.245 · 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

Quick stats

Citations3
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Storage TechnologiesFrench-language works237,207