{"id":"W2954733970","doi":"10.1145/3314221.3314612","title":"Modular divide-and-conquer parallelization of nested loops","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Nested loop join; Loop fusion; Correctness; Divide and conquer algorithms; Loop tiling; Parallel computing; Modular design; Loop (graph theory); Automatic parallelization; Loop fission; Abstraction; Programming language; Traverse; Theoretical computer science; Compiler; Mathematics","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.0007563179,0.0007136321,0.0006268594,0.0004790131,0.0005583764,0.0007247052,0.001395153,0.0003652199,0.002197024],"category_scores_gemma":[0.00233264,0.0004183656,0.000773466,0.0005204208,0.001103784,0.0009255762,0.001148555,0.000899069,0.0005715834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000468445,"about_ca_system_score_gemma":0.000862199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001073061,"about_ca_topic_score_gemma":0.001583014,"domain_scores_codex":[0.9992846,0.0001478406,0.00003828003,0.000151218,0.0002703152,0.0001078442],"domain_scores_gemma":[0.9991153,0.0002526714,0.0001063772,0.0003186855,0.0001683129,0.00003875218],"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.0003434805,0.0003179497,0.002784451,0.0004516628,0.0001523082,0.000481138,0.0009754615,0.2916723,0.1536769,0.1101313,0.006773625,0.4322393],"study_design_scores_gemma":[0.00007239043,0.0001499513,0.0004746645,0.00002069879,0.000050615,0.0001447515,0.0000620058,0.8670714,0.0799607,0.04323629,0.008733403,0.0000231173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01702901,0.00004434834,0.978959,0.00005404911,0.00001216096,0.0000604493,0.00002239572,0.002093983,0.001724612],"genre_scores_gemma":[0.2330059,0.00006568288,0.7643249,0.00006686425,0.00002478306,0.0001628991,0.0001510488,0.0005207725,0.001677058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002197024,"threshold_uncertainty_score":0.007349789,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007286280866716614,"score_gpt":0.2186633518350398,"score_spread":0.2113770709683232,"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."}}