{"id":"W2736699952","doi":"10.1145/3087801.3087837","title":"Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Mutual exclusion; Constant (computer programming); Deadlock; Binary logarithm; Amortized analysis; Mathematics; Computer science; Theoretical computer science; Computational complexity theory; Combinatorics; Algorithm; Discrete mathematics; Data structure; Distributed computing","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.003086641,0.001186448,0.001696935,0.0007929697,0.00173162,0.00270419,0.004404567,0.001784313,0.003385208],"category_scores_gemma":[0.01194464,0.0005643737,0.001148297,0.001164012,0.002398613,0.005856907,0.00467261,0.003384449,0.0009541038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003349506,"about_ca_system_score_gemma":0.00403225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002690454,"about_ca_topic_score_gemma":0.003641629,"domain_scores_codex":[0.9939373,0.001950844,0.0002759176,0.0009549871,0.001592143,0.001288851],"domain_scores_gemma":[0.9791358,0.01116477,0.001549192,0.006388942,0.001112009,0.0006492861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002632007,0.0004544388,0.002537905,0.0005274868,0.0001807342,0.0004325915,0.0006122929,0.4690441,0.02971027,0.3777675,0.01523915,0.1008615],"study_design_scores_gemma":[0.0001935131,0.0001215273,0.0001888965,0.00001584558,0.00005543281,0.0001212985,0.00004074861,0.8468269,0.009962777,0.1399517,0.002468166,0.00005325245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1026827,0.0006710998,0.8790106,0.001454479,0.0001005576,0.0002048486,0.0003186175,0.006775997,0.008781055],"genre_scores_gemma":[0.8427842,0.0001919865,0.1516033,0.0004152258,0.000111348,0.0003210783,0.0004298569,0.0005607876,0.003582234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004404567,"threshold_uncertainty_score":0.02430254,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06984348159744433,"score_gpt":0.2909975523089776,"score_spread":0.2211540707115333,"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."}}