{"id":"W3006309927","doi":"10.1145/3140587.3062355","title":"Synthesis of divide and conquer parallelism for loops","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Computer science; Divide and conquer algorithms; Joins; Parallel computing; Programmer; Traverse; Code (set theory); Parallelism (grammar); Programming language; Theoretical computer science; Set (abstract data type)","routes":{"ca_aff":true,"ca_fund":true,"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.0002756985,0.00009080988,0.0001756579,0.00004705188,0.0002602573,0.0002122447,0.001380943,0.00005169282,0.000002592789],"category_scores_gemma":[0.001122207,0.00007910764,0.00003353158,0.00002351116,0.0000919616,0.0003325542,0.0004079684,0.00003908915,0.00000227646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003713018,"about_ca_system_score_gemma":0.00001819598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006388489,"about_ca_topic_score_gemma":0.000008731606,"domain_scores_codex":[0.9993402,0.00002655933,0.0001624036,0.0002259722,0.0001002838,0.0001445872],"domain_scores_gemma":[0.9980036,0.0007354851,0.0002510808,0.0008868412,0.00007648964,0.00004651141],"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.0001592966,0.0003701048,0.0744516,0.0008775532,0.0003883824,0.00003424966,0.003898912,0.005683405,0.002204229,0.3424068,0.03677924,0.5327463],"study_design_scores_gemma":[0.002281793,0.0006721967,0.1250372,0.0006752778,0.000178847,0.00002944923,0.0000749843,0.5778962,0.1413925,0.1195068,0.03051469,0.001740001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04620452,0.0003149,0.9455483,0.003507436,0.0002272249,0.0002993938,0.00001284793,0.0002552135,0.00363014],"genre_scores_gemma":[0.7880645,0.00003660789,0.2116582,0.00009013415,0.00003456744,0.00001432579,0.000001059799,0.000004659404,0.00009587894],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.74186,"threshold_uncertainty_score":0.3225916,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0332562492190776,"score_gpt":0.2947483492212483,"score_spread":0.2614921000021707,"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."}}