{"id":"W3177419060","doi":"10.1145/3409964.3461819","title":"A Scalable Recoverable Skip List for Persistent Memory","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Concurrent data structure; Scalability; Parallel computing; Lock (firearm); Data structure; Blocking (statistics); Linked list; Benchmark (surveying); Concurrency; Node (physics); Persistent data structure; B-tree; Algorithm; Distributed computing; Database; 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.0006407944,0.0005414736,0.0004695211,0.001270044,0.0009450066,0.001400446,0.002821535,0.0004975484,0.006644401],"category_scores_gemma":[0.00284445,0.0003730815,0.0004682754,0.001421666,0.0006002191,0.00270279,0.002219659,0.001104728,0.002077779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001051359,"about_ca_system_score_gemma":0.002454668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003267898,"about_ca_topic_score_gemma":0.00470831,"domain_scores_codex":[0.9993234,0.00006815403,0.00005429072,0.00009694949,0.0003577711,0.00009947296],"domain_scores_gemma":[0.9980032,0.0002995819,0.0001465032,0.0007784699,0.0006442956,0.0001280193],"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.001479047,0.0004249312,0.003149732,0.000545482,0.00007948795,0.0003698813,0.0004279719,0.04025875,0.05726571,0.05578879,0.04531916,0.794891],"study_design_scores_gemma":[0.0005228294,0.001113856,0.001333272,0.0001466231,0.0001122906,0.0008036808,0.0003035639,0.7113299,0.1353094,0.03845756,0.1103805,0.0001863518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0545993,0.001172327,0.8921366,0.00038085,0.0002854861,0.0005071847,0.0008712587,0.0401745,0.009872508],"genre_scores_gemma":[0.2442037,0.000418459,0.735126,0.0003380876,0.00009627183,0.0004138896,0.003240422,0.001458088,0.01470514],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006644401,"threshold_uncertainty_score":0.0222277,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02597355170160844,"score_gpt":0.2535948008980298,"score_spread":0.2276212491964214,"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."}}