{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001579718,0.00007327844,0.0001237924,0.00007820062,0.00002549093,0.00004039313,0.0002837777,0.00004564993,0.00002527523],"category_scores_gemma":[0.0000176114,0.00006351018,0.0000241628,0.000206616,0.00001763048,0.000242177,0.0001500928,0.00003814736,0.00002019815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005912139,"about_ca_system_score_gemma":0.00001746425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002448939,"about_ca_topic_score_gemma":6.723256e-7,"domain_scores_codex":[0.9993474,0.00003900583,0.0001771723,0.0002054504,0.0001275289,0.0001034284],"domain_scores_gemma":[0.9994341,0.00003841447,0.00007525157,0.0003240712,0.00009451751,0.00003364987],"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":[0.000009545877,0.0001249418,0.04535389,0.00008763719,0.00003970771,0.000002574041,0.0007906238,0.09110419,0.005569439,0.8231685,0.002146533,0.03160241],"study_design_scores_gemma":[0.0002537154,0.00007020629,0.01074057,0.00002172358,0.000002628395,0.000004932598,0.000004320091,0.9741684,0.006150023,0.007239983,0.00119642,0.0001471258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04521104,0.00007037012,0.9486368,0.0002545568,0.00006335964,0.0001244498,1.918769e-7,0.0002892146,0.005350044],"genre_scores_gemma":[0.8542188,0.00002791336,0.1446029,0.000189374,0.00000736938,0.000002307128,0.000002213419,0.000004158197,0.0009449288],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8830642,"threshold_uncertainty_score":0.258987,"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."}}