{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001053537,0.000745507,0.0005611577,0.0006098932,0.0003762135,0.0009808779,0.001008815,0.0006735441,0.002109518],"category_scores_gemma":[0.004928329,0.000400503,0.0004571347,0.0006730093,0.0008484829,0.001565538,0.0004940609,0.0008075244,0.000151018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001684222,"about_ca_system_score_gemma":0.001036917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003696742,"about_ca_topic_score_gemma":0.001821549,"domain_scores_codex":[0.9993222,0.0001705672,0.0000220734,0.00005716414,0.0003275926,0.0001004447],"domain_scores_gemma":[0.9981259,0.001273664,0.0002381626,0.000102752,0.000190394,0.00006909134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003213008,0.000011138,0.0001337199,0.0000295114,0.000007855334,0.00003828623,0.00001760561,0.9651836,0.0009609965,0.03036234,0.0001702061,0.003052652],"study_design_scores_gemma":[0.000004186634,0.000008853559,0.00004237139,0.000001988205,0.000003822327,0.000008145212,0.000003900542,0.9872553,0.0004349623,0.01203752,0.0001968104,0.000002116604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1613885,0.0005897718,0.8291833,0.0006569552,0.00004300925,0.00007675378,0.0001607823,0.0002627691,0.007638102],"genre_scores_gemma":[0.9419437,0.0004114633,0.05365986,0.00005316274,0.000030365,0.0001550164,0.0001195322,0.0001143904,0.003512462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003696742,"threshold_uncertainty_score":0.01221991,"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."}}