{"id":"W2057608154","doi":"10.1145/1056018.1056037","title":"Adding parallelism to visual data flow programs","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Compiler; Debugging; Parallelism (grammar); Data parallelism; Implicit parallelism; Visual programming language; Programming paradigm; Task (project management); Shared memory; Data flow diagram; Parallel computing; Task parallelism; Database","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003107731,0.0001113009,0.0001093616,0.0000876967,0.0001072019,0.000285768,0.001891093,0.00004191895,0.00002425713],"category_scores_gemma":[0.00003475709,0.00009844657,0.00002347455,0.0003593791,0.00001127277,0.0005910675,0.00120057,0.00007665383,0.0002234561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002193234,"about_ca_system_score_gemma":0.00003295047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001413028,"about_ca_topic_score_gemma":0.0000122218,"domain_scores_codex":[0.9988138,0.00003290674,0.0001917225,0.0004777751,0.00020961,0.0002741885],"domain_scores_gemma":[0.9988216,0.00002702303,0.00003493069,0.0009273346,0.0000563875,0.0001327884],"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.000002074499,0.0000946911,0.0000710688,0.000002333748,0.000007629525,0.000002803143,0.0002400978,0.02086621,0.0000236525,0.0104093,0.05422448,0.9140556],"study_design_scores_gemma":[0.00007553288,0.00004697826,0.00003837673,0.00001021309,0.000001074494,0.000005412867,0.000003361652,0.8705257,0.0002435961,0.0001095491,0.1287994,0.000140764],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002719321,0.00003360179,0.986909,0.002474385,0.00008688136,0.000170551,6.301748e-7,0.001521152,0.008531808],"genre_scores_gemma":[0.105723,0.000006977297,0.8915054,0.00148754,0.0001509991,0.00001096868,0.00002332086,0.000007042611,0.001084772],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9139149,"threshold_uncertainty_score":0.4014535,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04624958948990547,"score_gpt":0.3237369077405177,"score_spread":0.2774873182506122,"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."}}