{"id":"W4234222194","doi":"10.1109/pads.1995.404296","title":"A fast asynchronous GVT algorithm for shared memory multiprocessor architectures","year":2002,"lang":"en","type":"article","venue":"","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"University of Waikato","keywords":"Computer science; Asynchronous communication; Parallel computing; Correctness; Overhead (engineering); Distributed computing; Multiprocessing; Shared memory; Distributed memory; Distributed shared memory; Synchronization (alternating current); Inter-process communication; Scheme (mathematics); Parallel algorithm; Memory management; Algorithm; Uniform memory access; Overlay; Operating system; Computer network","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.0005961248,0.0004923414,0.0004475522,0.0005179227,0.0004610243,0.0006741834,0.00125689,0.0006168866,0.003557599],"category_scores_gemma":[0.002124471,0.0002753917,0.0003165573,0.0006131711,0.0004776025,0.001042665,0.0007908345,0.000782354,0.001000391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005184122,"about_ca_system_score_gemma":0.0008395643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002177264,"about_ca_topic_score_gemma":0.002137273,"domain_scores_codex":[0.9997047,0.0000632729,0.00001874967,0.00004497598,0.0001397602,0.00002852578],"domain_scores_gemma":[0.9994266,0.000219344,0.00005863055,0.00008021309,0.0001764615,0.00003883723],"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.0003671671,0.00005235397,0.0007585901,0.0001718697,0.00004787174,0.0001713211,0.0001282706,0.4206953,0.0265102,0.05680776,0.006630671,0.4876587],"study_design_scores_gemma":[0.00006229372,0.00005527973,0.0000818207,0.000008654926,0.000006928551,0.0000460972,0.00001141392,0.9784108,0.004163614,0.01141886,0.005723733,0.00001046916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002541327,0.00007208133,0.9959538,0.00005093493,0.00004575642,0.00002695518,0.00002085165,0.0005919277,0.0006963388],"genre_scores_gemma":[0.08775958,0.0001432069,0.9089437,0.00004616544,0.00004371511,0.0001523678,0.0001894733,0.0002212959,0.002500453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003557599,"threshold_uncertainty_score":0.01190132,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1042108855436177,"score_gpt":0.3835169804583637,"score_spread":0.279306094914746,"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."}}