{"id":"W2120128957","doi":"10.1109/ipps.1993.262775","title":"Transformation of Doacross loops on distributed memory systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallel computing; Compiler; Overhead (engineering); Speedup; Loop fusion; Partition (number theory); Transformation (genetics); Loop (graph theory); Parallelism (grammar); Distributed memory; Compile time; Exploit; Loop fission; Nested loop join; Shared memory; Programming language","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.0001526985,0.00006963969,0.0001065997,0.00006446061,0.00005872384,0.00006353777,0.0003350353,0.00004098071,0.00001356894],"category_scores_gemma":[0.0000104429,0.00005808979,0.00003529932,0.0002597461,0.00001836975,0.0002088336,0.00002276499,0.00004955551,0.00002646689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001781608,"about_ca_system_score_gemma":0.00000501901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001811549,"about_ca_topic_score_gemma":3.415953e-7,"domain_scores_codex":[0.9993229,0.00003885041,0.0002258467,0.0001270664,0.000170864,0.0001144612],"domain_scores_gemma":[0.9995162,0.00003676806,0.00007216376,0.000267228,0.00007396138,0.00003364886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001213735,0.0004771649,0.0001123295,0.0001557227,0.00003863893,0.000006138596,0.003689963,0.4964933,0.0004799094,0.4119811,0.03766982,0.04888374],"study_design_scores_gemma":[0.0001642299,0.00007064044,0.00006984048,0.00002332489,0.000001142796,0.000004658097,0.00001766652,0.9907026,0.007700746,0.0001302815,0.001032823,0.00008204769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002466165,0.00005287841,0.9709489,0.0002232198,0.000110468,0.0001147007,0.000004354878,0.0004423369,0.02563698],"genre_scores_gemma":[0.9857399,0.00001850401,0.01367475,0.00006681355,0.0000123146,0.000005222327,0.000005205917,0.000002852619,0.0004743611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9832738,"threshold_uncertainty_score":0.2368833,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02263463274082609,"score_gpt":0.2432763004862828,"score_spread":0.2206416677454567,"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."}}