MétaCan
Menu
Back to cohort
Record W2155425945 · doi:10.1109/ares.2007.42

Applying a Tradeoff Model (TOM) to TACT

2007· article· en· W2155425945 on OpenAlexaff
Raihan Al-Ekram, Ric Holt, Chris Hobbs

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed systems and fault tolerance
Canadian institutionsNortel (Canada)University of Waterloo
Fundersnot available
KeywordsTactConsistency (knowledge bases)Replication (statistics)Computer scienceMiddleware (distributed applications)Distributed computingQuality (philosophy)SoftwareReliability engineeringEngineeringArtificial intelligenceOperating system

Abstract

fetched live from OpenAlex

In a software system, it is inevitable that components will occasionally fail to produce acceptable results and become unavailable to serve its clients. Replication is the technique often used to increase the availability of a system. But replication introduces the issue of inconsistency among the replicas. TACT is a middleware toolkit for building services that can make a controlled and systematic tradeoff between the availability and the data consistency in the system. This paper presents a tradeoff model TOM that gives various properties and constraints that apply to a tradeoff situation. Using this model we show that the tradeoff in TACT is essentially 4 dimensional rather than just 2. The capacity and demand of the system adds additional dimensions to the basic availability and consistency tradeoff. We also show how TOM can be used to fulfil the QoS goals of the system with dynamically changing load and failure characteristics

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 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: none
Teacher disagreement score0.902
Threshold uncertainty score0.338

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.021
GPT teacher head0.270
Teacher spread0.250 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations1
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicDistributed systems and fault toleranceFrench-language works237,207