MétaCan
Menu
Back to cohort
Record W2098412892 · doi:10.1109/mascot.1995.378646

Interval-based performance analysis of computing systems

2002· article· en· W2098412892 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 institutionsCarleton University
Fundersnot available
KeywordsInterval arithmeticInterval (graph theory)Context (archaeology)Computer scienceKey (lock)Affine arithmeticArithmeticAlgorithmTheoretical computer scienceMathematics

Abstract

fetched live from OpenAlex

Analytic performance models are often used for predicting the performance of computing systems. Existing models accept single valued parameters as input and produce single valued performance measures as outputs. This research proposes to associate intervals or ranges of values with performance measures and key system parameters. Such an approach is appropriate when exact parameter values are unknown but approximate ranges for parameters may be estimated. Conventional arithmetic cannot handle intervals and interval arithmetic-based techniques are required. The paper reports on the feasibility of application of interval arithmetic in the solution of existing well-known models of computing systems. One of the problems with using interval arithmetic is the potential loosening in the interval for the model output: the computed interval may be wider than the actual interval. A computational method based on the notion of interval splitting is introduced in this paper for controlling this problem. The technique is found to be effective in the context of a number of models.< <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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.840
Threshold uncertainty score0.283

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.001
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.027
GPT teacher head0.248
Teacher spread0.221 · 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