MétaCan
Menu
Back to cohort
Record W1715605981 · doi:10.1109/hicss.1991.183914

Hector-a hierarchically structured shared memory multiprocessor

2002· article· en· W1715605981 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 institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceScalabilityDistributed memoryParallel computingUniform memory accessDistributed shared memoryModular designMultiprocessingLocalityExploitShared memoryBandwidth (computing)InterconnectionInterleaved memoryComputer architectureMemory managementComputer hardwareOperating systemSemiconductor memoryComputer network

Abstract

fetched live from OpenAlex

Hector is a shared-memory multiprocessor with a hierarchical interconnection structure that has three important advantages. First, it uses only short transmission lines and allows implementations with simple, modular hardware. This makes it scalable to match the needs of tomorrow's high speed microprocessors. Second, the cost and the overall bandwidth of the structure grow linearly with the number of processing modules. This makes Hector expandable to moderate sizes of up to 256 PMs, yet allows small-scale systems at a low cost. Finally, the cost of a memory access grows incrementally with the distance between the processor and memory location. This allows single threaded applications, applications with a small degree of parallelism, and applications with a high degree of locality in their memory accesses to exploit the low cost of localized memory accesses.< <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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.964
Threshold uncertainty score0.460

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.020
GPT teacher head0.239
Teacher spread0.219 · 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