{"id":"W1919074074","doi":"10.1109/pacrim.1995.519539","title":"Time-cost analysis of fault-tolerant parallel programs with timing constraints","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Fault tolerance; Computation; Parallel computing; Software fault tolerance; Distributed computing; Algorithm","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001734288,0.0001344684,0.0002975724,0.0002738821,0.00007356103,0.00008511115,0.0005350232,0.00004848797,0.0002131896],"category_scores_gemma":[0.000009656905,0.0001017481,0.00009884356,0.001389338,0.0001502716,0.0001731487,0.00008307374,0.00007357128,0.00003156612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001442472,"about_ca_system_score_gemma":0.00001433528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001674438,"about_ca_topic_score_gemma":0.000004801297,"domain_scores_codex":[0.9988652,0.00004617109,0.0002792299,0.0003184777,0.0002593958,0.0002315421],"domain_scores_gemma":[0.9991334,0.00004941356,0.0001463797,0.0004522705,0.0001404621,0.00007807455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001688662,0.0008270849,0.005709313,0.00002723313,0.001482326,0.00004129714,0.003010925,0.4522692,0.0001046668,0.01302052,0.003559814,0.5199307],"study_design_scores_gemma":[0.0001944624,0.00008441538,0.0002664428,0.0000188363,0.00006686158,0.00000700341,0.00001324703,0.9987038,0.0001792554,0.00002507023,0.0002880814,0.0001524742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003939006,0.00003104016,0.9783694,0.0001727085,0.00001220594,0.0001961324,0.000001068375,0.0005141532,0.01676432],"genre_scores_gemma":[0.5380911,0.000008202853,0.4609594,0.0001044049,0.000005010676,0.00001110168,0.00000621054,0.000005015044,0.0008094874],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5464346,"threshold_uncertainty_score":0.4149165,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03114067921758834,"score_gpt":0.2529684181152052,"score_spread":0.2218277388976168,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}