{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001971273,0.001025211,0.002104926,0.0007795577,0.001564317,0.002053078,0.004167514,0.001244009,0.01293959],"category_scores_gemma":[0.005964703,0.0006930471,0.0008727749,0.00121667,0.001099108,0.002582224,0.004322363,0.002332602,0.003762417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001407687,"about_ca_system_score_gemma":0.003356902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001777521,"about_ca_topic_score_gemma":0.003842889,"domain_scores_codex":[0.9960085,0.001165665,0.0001639467,0.000502283,0.001348733,0.0008107965],"domain_scores_gemma":[0.9953386,0.001860103,0.0002733496,0.001818443,0.0004983631,0.0002112097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003487617,0.0007684063,0.0006640395,0.0006196516,0.0001194664,0.0003146663,0.0003616665,0.1856869,0.03610229,0.2394199,0.05421736,0.478238],"study_design_scores_gemma":[0.0005081284,0.0003516542,0.0003172986,0.00004324957,0.00005843953,0.0001973563,0.00007074597,0.8550147,0.01583854,0.1126379,0.01487617,0.00008574692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03077312,0.0005963179,0.9291146,0.0006632882,0.0004303879,0.0003416064,0.0005875388,0.01289468,0.0245984],"genre_scores_gemma":[0.5399341,0.000310611,0.4233229,0.0005378295,0.0002405711,0.0006017936,0.00151292,0.001499891,0.03203934],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01293959,"threshold_uncertainty_score":0.04328728,"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."}}