MétaCan
Menu
Back to cohort
Record W2161459218 · doi:10.1109/wafer.1989.47567

Extremally fault tolerant arrays

2003· article· en· W2161459218 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
TopicInterconnection Networks and Systems
Canadian institutionsMcGill University
Fundersnot available
KeywordsSpare partCover (algebra)USableFault toleranceRowDimension (graph theory)Row and column spacesMetric (unit)HomogeneousComputer scienceColumn (typography)Fault (geology)MathematicsCombinatoricsAlgorithmDiscrete mathematicsEngineeringDistributed computing

Abstract

fetched live from OpenAlex

The author characterizes the repairability of arrays without regard to how their faults are distributed. Worst-case, or extremal fault tolerance, is used as a basic metric for any redundant system. Two schemes are examined: a traditional dedicated spares model in which spare rows and columns cover rows and columns with faults, and a homogeneous model in which every row and column is a spare. In both cases deciding the existence of a fault cover is NP-complete, thus providing impetus for the extremal (i.e. worst-case) approach. With dedicated spares the extremal fault tolerance is just the number of spares; within this number of faults, a cover is constructed in time proportional to the dimensions of the array. Finding the homogeneous extremal fault tolerance is equivalent to the problem in which the number of spares does not exceed the dimension of the desired usable array. Within this number of faults, a repair is found in time proportional to the size of the array.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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: Empirical · Consensus signal: none
Teacher disagreement score0.965
Threshold uncertainty score0.518

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.017
GPT teacher head0.220
Teacher spread0.203 · 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

Citations15
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicInterconnection Networks and SystemsFrench-language works237,207