{"id":"W2159681195","doi":"10.1109/icci.1992.227678","title":"Revisiting parallel speedup complexity","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Speedup; Computation; Computer science; Parallel computing; Automated theorem proving; Parallel algorithm; Theoretical computer science; 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.0003927957,0.00009617539,0.0001183517,0.00005722867,0.0001451979,0.0001396445,0.0004698095,0.00003341966,0.00007723647],"category_scores_gemma":[0.00008081696,0.0000871184,0.00004774195,0.0002771031,0.00003037049,0.0002052414,0.00009376967,0.00008331084,0.00009076612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001791434,"about_ca_system_score_gemma":0.00002968531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009837344,"about_ca_topic_score_gemma":4.712286e-7,"domain_scores_codex":[0.9990919,0.0001005527,0.0001850312,0.0002627606,0.0001445382,0.000215263],"domain_scores_gemma":[0.9993474,0.00004920274,0.00006072113,0.0004065797,0.00006609065,0.00006995165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[3.376302e-7,0.00001241675,0.0004246108,0.000003328272,0.000002973471,0.000002717744,0.00004169859,0.001035787,0.0000167041,0.9920342,0.002656487,0.003768753],"study_design_scores_gemma":[0.0006313898,0.00007253083,0.002619879,0.00005286931,0.000005041037,0.0001146011,0.00003311523,0.7042036,0.004765258,0.2027239,0.08394989,0.0008279384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002782658,0.00005543332,0.8131253,0.0004654002,0.00006687764,0.00005822326,1.000314e-7,0.0007655167,0.185185],"genre_scores_gemma":[0.1747339,0.00001083528,0.8234772,0.0006283906,0.00002516942,0.000002199356,7.228837e-7,0.000004300346,0.00111729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7893103,"threshold_uncertainty_score":0.3552585,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05028716493988472,"score_gpt":0.2884030979953407,"score_spread":0.238115933055456,"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."}}