MétaCan
Menu
Back to cohort
Record W2163293317 · doi:10.1109/hase.2008.14

At What Level of Granularity Should We be Componentizing for Software Reliability?

2008· article· en· W2163293317 on OpenAlexaff
Atef Mohamed, Mohammad Zulkernine

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSoftware Reliability and Analysis Research
Canadian institutionsQueen's University
Fundersnot available
KeywordsGranularityDecompositionComponent (thermodynamics)Computer scienceReliability engineeringReliability (semiconductor)Software systemSoftwareComponent-based software engineeringArchitectural patternSoftware constructionProgramming languageEngineering

Abstract

fetched live from OpenAlex

In component-based software systems (CBSSs), software designers need to decide about decomposition level (level of granularity) which involves component sizes and the number of components. In these systems, decomposition level is important due to its major impacts on reliability. However, the basis to choose the decomposition level of a CBSS has not been addressed adequately in the existing research. On the other hand, software system components may vary with respect to their criticalities to different failures. The knowledge about component failure criticalities are currently not incorporated in the architectural design decisions of these systems. As a result, these systems consider different failures equally and disregard the various severities of different failures. In this paper, we study the level of decomposition of CBSSs with respect to its impact on their reliabilities based on various component failure criticalities. We discuss the level of decomposition impacts on CBSS architectures with respect to the architectural attributes and component failure criticalities. We derive the reliability of these systems and show the level of decomposition impacts on these system reliabilities.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.019
Version: metacan-v3-hybrid-931329e0061cValidation 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.003
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.019
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0030.005
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.001

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.294
GPT teacher head0.351
Teacher spread0.057 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Citations6
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicSoftware Reliability and Analysis ResearchFrench-language works237,207