{"id":"W2626245353","doi":"10.1145/3062341.3062355","title":"Synthesis of divide and conquer parallelism for loops","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"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":"Divide and conquer algorithms; Computer science; Joins; Parallel computing; Programmer; Traverse; Code (set theory); Parallelism (grammar); Programming language; Code generation; Theoretical computer science; Operating system; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008354333,0.0006267563,0.0005842057,0.0006561336,0.0007049274,0.0008575398,0.0007908839,0.0004315739,0.002055896],"category_scores_gemma":[0.003529469,0.0004156271,0.0007010037,0.0007513307,0.00101448,0.0007791722,0.0007110701,0.0006963209,0.0005676592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007317261,"about_ca_system_score_gemma":0.001338651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001428597,"about_ca_topic_score_gemma":0.002082829,"domain_scores_codex":[0.9990514,0.0001436661,0.0000536607,0.0001900123,0.0004545492,0.0001066234],"domain_scores_gemma":[0.9985546,0.0006130565,0.0001670657,0.0002754388,0.0003483586,0.00004151874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004590239,0.0002243629,0.002513581,0.0006996066,0.00007822828,0.0004783534,0.0007192956,0.3753134,0.1336277,0.155439,0.005781649,0.3246658],"study_design_scores_gemma":[0.00007728294,0.000180556,0.0002555626,0.00003854877,0.00004333716,0.0001337922,0.00007626028,0.8106433,0.1124577,0.06284854,0.01322615,0.00001891001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04102981,0.0001541512,0.9501692,0.0001087481,0.00003768318,0.00008056292,0.00008121523,0.002642313,0.005696297],"genre_scores_gemma":[0.2946344,0.0001324312,0.7007245,0.00007936628,0.00003216967,0.0001799354,0.0002615821,0.0006802952,0.003275441],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002055896,"threshold_uncertainty_score":0.006877601,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02488637193809053,"score_gpt":0.2847567466395196,"score_spread":0.259870374701429,"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."}}