{"id":"W2134703599","doi":"10.1109/tpds.2006.146","title":"Tight Bounds for Critical Sections in Processor Consistent Platforms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Sequential consistency; Computer science; Consistency (knowledge bases); Consistency model; Algorithm; Strong consistency; Upper and lower bounds; Extension (predicate logic); Variable (mathematics); Theoretical computer science; Mathematics; Programming language; Artificial intelligence; Statistics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01089579,0.002317262,0.001975027,0.003899721,0.003714435,0.006858333,0.005644111,0.002414923,0.006725763],"category_scores_gemma":[0.06084589,0.002432779,0.001628705,0.001891463,0.006947384,0.01559749,0.008016721,0.006404389,0.001513961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007382181,"about_ca_system_score_gemma":0.006160683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003282643,"about_ca_topic_score_gemma":0.00414773,"domain_scores_codex":[0.9858606,0.002310733,0.0007500621,0.002785417,0.005233606,0.003059595],"domain_scores_gemma":[0.936952,0.04065934,0.005292481,0.009682611,0.005050848,0.002362673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001502064,0.0003786476,0.00424553,0.0006279517,0.0001604349,0.0005245705,0.001567225,0.2989135,0.02531928,0.5770365,0.006259473,0.08346479],"study_design_scores_gemma":[0.000116171,0.000317713,0.0006167923,0.0001881412,0.0001040557,0.0001843421,0.00024751,0.4439931,0.02232956,0.524996,0.006838568,0.00006808701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09070504,0.002753974,0.8853052,0.002000195,0.0002472316,0.0003699378,0.0001745374,0.002726631,0.01571724],"genre_scores_gemma":[0.7578179,0.001283395,0.2279828,0.0009322691,0.0003373385,0.0007229302,0.0002732767,0.001327844,0.009322353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01089579,"threshold_uncertainty_score":0.05762315,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01655113340245643,"score_gpt":0.2537222123865423,"score_spread":0.2371710789840859,"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."}}