{"id":"W2929273575","doi":"10.48550/arxiv.1904.01031","title":"Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops (Extended Version)","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Nested loop join; Parallel computing; Loop fusion; Divide and conquer algorithms; Loop tiling; Correctness; Modular design; Loop (graph theory); Abstraction; Parallelism (grammar); Loop fission; Programming language; Traverse; Automatic parallelization; 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.0005157207,0.0005089685,0.0003941882,0.000358493,0.000318203,0.0006007995,0.0008113609,0.000283213,0.002726074],"category_scores_gemma":[0.001361793,0.0003323165,0.0006398661,0.0004008051,0.0007708083,0.000625518,0.0007931907,0.0006295299,0.0006985192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003740581,"about_ca_system_score_gemma":0.0006837242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006055356,"about_ca_topic_score_gemma":0.0009196553,"domain_scores_codex":[0.9996237,0.00005910408,0.00002120098,0.00008789131,0.0001410176,0.00006711096],"domain_scores_gemma":[0.999534,0.0001121038,0.00005656017,0.0001844254,0.00009106111,0.00002188007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002931763,0.0002084382,0.001678154,0.0005729388,0.0001113533,0.0004664251,0.0005580424,0.2503409,0.235619,0.1576036,0.005670639,0.3468774],"study_design_scores_gemma":[0.00008990044,0.0002042567,0.0004318024,0.00003172994,0.00006087627,0.0001880851,0.00004787096,0.7942264,0.1224205,0.06548185,0.01679188,0.00002492626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02253209,0.00007093172,0.9725408,0.00006849468,0.00002321942,0.00006045994,0.00004025608,0.001558452,0.003105399],"genre_scores_gemma":[0.2716656,0.00007898249,0.7250179,0.00007476144,0.00002704616,0.0001668498,0.0001518596,0.0004060321,0.002411],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002726074,"threshold_uncertainty_score":0.00911963,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04397603319946865,"score_gpt":0.1957794254449125,"score_spread":0.1518033922454438,"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."}}