Dynamic combined pattern-parallel and fault-parallel fault simulation on computational RAM
Bibliographic record
Abstract
Computational RAM (C/spl middot/RAM) is a logic-enhanced memory architecture that supports massively-parallel bit-serial computation. Previous work (J.A. Waicukauski et al., 1987; B.F. Cockburn et al., 1998, A.L.-C. Kwong, 1998) investigated the implementation of fault-parallel and pattern-parallel fault simulation algorithms on C/spl middot/RAM. The fault-parallel strategy was found to be efficient at the start of the simulation but inefficient at the end. The converse behaviour was observed for the pattern-parallel strategy. A dynamic hybrid algorithm combines the fault-parallel and pattern-parallel strategies in an adjustable proportion so as to obtain the best aspects of both. This paper describes a dynamic hybrid fault simulator for C/spl middot/RAM that models the detection in combinational logic of stuck-at faults, transition faults of order 1, and CMOS transistor stuck-open faults.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
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".