{"id":"W4388919408","doi":"10.1109/tpds.2023.3335671","title":"Simple, Fast and Widely Applicable Concurrent Memory Reclamation via Neutralization","year":2023,"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 Waterloo","funders":"University of Waterloo","keywords":"Computer science; Garbage collection; Garbage; Concurrent data structure; Bounded function; Overhead (engineering); Parallel computing; POSIX Threads; Concurrency; Data consistency; Consistency (knowledge bases); Distributed computing; Synchronization (alternating current); Data structure; Key (lock); Operating system; Programming language; Computer network; Thread (computing)","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.001240712,0.0007849412,0.0007105295,0.0006657417,0.001045296,0.00140761,0.002693497,0.0006166906,0.00170624],"category_scores_gemma":[0.004268747,0.0005081206,0.0007334841,0.0006241641,0.001616242,0.002766217,0.00279722,0.001419558,0.001044689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000863018,"about_ca_system_score_gemma":0.002211623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001573926,"about_ca_topic_score_gemma":0.002301666,"domain_scores_codex":[0.9983689,0.0002359631,0.0001587301,0.0003412705,0.0006622819,0.0002327768],"domain_scores_gemma":[0.9954803,0.0009662857,0.0006651129,0.001907004,0.0008316743,0.0001495903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001697484,0.0002921222,0.008214882,0.0009209598,0.0001190375,0.000563825,0.002763757,0.02488374,0.3015971,0.05212815,0.008786963,0.5980321],"study_design_scores_gemma":[0.0003033115,0.001213767,0.002083268,0.0002161592,0.0001921092,0.001479126,0.0007776336,0.2312917,0.6374786,0.0416165,0.08308648,0.0002613383],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08579485,0.001354514,0.8938921,0.0003582879,0.0002079991,0.0002346883,0.0001112352,0.01272791,0.005318415],"genre_scores_gemma":[0.6148772,0.000559903,0.3762906,0.0004921494,0.00006525868,0.0002867344,0.0002848968,0.001308185,0.005835013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002693497,"threshold_uncertainty_score":0.006561637,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0190597563591469,"score_gpt":0.2474257967046296,"score_spread":0.2283660403454827,"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."}}