{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000857443,0.0006413547,0.0005953994,0.0006728781,0.0007319688,0.0009042123,0.0008546587,0.0004413364,0.002187173],"category_scores_gemma":[0.003625104,0.0004370004,0.0007314243,0.0007852393,0.001036795,0.0008328235,0.0007491326,0.0007187099,0.0006174602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008016148,"about_ca_system_score_gemma":0.001439254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001623006,"about_ca_topic_score_gemma":0.002435055,"domain_scores_codex":[0.9989507,0.0001606099,0.00005941252,0.000211406,0.0004975408,0.000120296],"domain_scores_gemma":[0.998444,0.0006507856,0.000174311,0.0003081271,0.0003780087,0.00004473646],"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.0005122401,0.0002303555,0.002600195,0.0006933629,0.00008042249,0.0004875264,0.0007529751,0.3693546,0.1329996,0.1501436,0.006454833,0.3356901],"study_design_scores_gemma":[0.00008112924,0.0001848577,0.000257794,0.00003777573,0.00004461574,0.0001275504,0.00007890261,0.8131881,0.1109263,0.06158248,0.01347137,0.00001924023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04468591,0.0001700543,0.9451987,0.0001215868,0.00004074517,0.00008681639,0.00009696621,0.003206707,0.006392554],"genre_scores_gemma":[0.3026246,0.0001339886,0.6921787,0.00008603431,0.00003404708,0.0001886029,0.0003021934,0.0007648221,0.003687026],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002187173,"threshold_uncertainty_score":0.007316768,"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."}}