{"id":"W1635884043","doi":"10.1007/978-3-642-33651-5_19","title":"RMR-Efficient Randomized Abortable Mutual Exclusion","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Mutual exclusion; Asynchronous communication; Abort; Adversary model; Critical section; Swap (finance); Logarithm; Scheduling (production processes); Deterministic algorithm; Randomized algorithm; Theoretical computer science; Algorithm; Adversary; Operating system; Mathematics; Computer network; Computer security","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003118378,0.000755638,0.001395144,0.0006969015,0.0004237226,0.0007123227,0.003766715,0.0004656085,0.0000790389],"category_scores_gemma":[0.0001507366,0.0006135881,0.00034194,0.0008073269,0.0009414762,0.0006006336,0.001761963,0.0008785945,0.0002580395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003720968,"about_ca_system_score_gemma":0.0005416475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005621534,"about_ca_topic_score_gemma":0.00002179297,"domain_scores_codex":[0.9942469,0.0001109778,0.001026325,0.001734945,0.001685368,0.001195475],"domain_scores_gemma":[0.9960776,0.0007046012,0.0005702426,0.001910871,0.000373686,0.0003630249],"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.0004605644,0.0001735423,0.00002234827,0.0001205543,0.00004842564,0.0001336683,0.002456415,0.09683209,0.0002410076,0.174152,0.0002668969,0.7250925],"study_design_scores_gemma":[0.01112141,0.00007181248,0.00002702499,0.0006638655,0.00002227031,0.0001153417,2.804064e-7,0.9482444,0.0004524805,0.02494365,0.01320282,0.001134673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001022085,0.003477303,0.9806166,0.0003855214,0.00450893,0.0009537869,0.0000173342,0.000243126,0.009695245],"genre_scores_gemma":[0.7443689,0.0002346823,0.2488831,0.001804621,0.002130853,0.00008290124,0.00003574435,0.0001052153,0.002353963],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8514123,"threshold_uncertainty_score":0.9996315,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01170293172390021,"score_gpt":0.2360855328042447,"score_spread":0.2243826010803445,"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."}}