{"id":"W2170284436","doi":"10.1109/spdp.1992.242729","title":"The Parallel Asynchronous Recursion model","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Recursion (computer science); Parallel computing; Asynchronous communication; Bulk synchronous parallel; Memory model; Parallel programming model; Theoretical computer science; Synchronization (alternating current); Merge (version control); Programming language; Computation; Model of computation; Abstraction; Semantics (computer science); Programming paradigm; Parallel algorithm; Shared memory","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.0003600877,0.00007532935,0.00005840519,0.00002552488,0.0003420311,0.000153474,0.000584643,0.00003540034,0.000004707382],"category_scores_gemma":[0.00005073502,0.00004766433,0.00003580846,0.0001582714,0.00002576387,0.0001390617,0.00007577879,0.00007300495,0.00003481947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002145252,"about_ca_system_score_gemma":0.00005860865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002727128,"about_ca_topic_score_gemma":0.000001271048,"domain_scores_codex":[0.9992855,0.00006669767,0.000128668,0.0001901199,0.0001352055,0.0001937957],"domain_scores_gemma":[0.9993257,0.00006886828,0.00004111641,0.0004631865,0.00005464204,0.00004646587],"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":[8.14176e-7,0.00001519271,0.0000152114,7.207246e-7,0.000002324968,5.621425e-7,0.00006210248,0.0976645,0.000009146457,0.881896,0.01117742,0.009155986],"study_design_scores_gemma":[0.00006956782,0.00001958845,0.000008950617,0.000002171432,5.94076e-7,0.000005657828,0.000003653281,0.9277386,0.0006009018,0.05952673,0.01194283,0.00008073006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009458269,0.0001498705,0.9079179,0.0006683565,0.00008680076,0.00006739477,5.674576e-8,0.0004824573,0.09053262],"genre_scores_gemma":[0.183445,0.000118933,0.8120333,0.0003793724,0.000007798368,0.000008042214,2.359318e-7,0.00000446071,0.004002882],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8300741,"threshold_uncertainty_score":0.2630661,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0161722298235738,"score_gpt":0.2498727433280329,"score_spread":0.2337005135044591,"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."}}