{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003194886,0.0002657337,0.0003554242,0.0001495899,0.0004428965,0.0003715613,0.0002435963,0.0001542843,0.000004100655],"category_scores_gemma":[0.00000373281,0.0002492503,0.00006645622,0.000858348,0.00006496891,0.0005095027,0.000006798541,0.00017031,0.0000712613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005484483,"about_ca_system_score_gemma":0.00003316518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002319138,"about_ca_topic_score_gemma":0.00002506021,"domain_scores_codex":[0.99806,0.0001276853,0.0005201355,0.0005795942,0.0003223274,0.0003902137],"domain_scores_gemma":[0.9990051,0.00009552741,0.0001632986,0.0003919566,0.000123458,0.0002206964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004042145,0.0001864234,0.0001678377,0.0004049703,0.0001061111,0.00002457001,0.0005495203,0.9274414,0.001405428,0.007930898,0.008903425,0.05283898],"study_design_scores_gemma":[0.0009860152,0.00009190973,0.001121792,0.00008880684,0.00002213904,0.00006216636,0.0002861814,0.9898565,0.0001448196,0.0002596672,0.006725243,0.0003547729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006635173,0.000270717,0.9901881,0.0002694082,0.0008631071,0.0006346377,0.0004845153,0.0005157206,0.0001386633],"genre_scores_gemma":[0.9987765,0.0001949604,0.00009359588,0.00004265857,0.00005362386,0.0002631799,0.0002341342,0.00001512649,0.0003262472],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9921413,"threshold_uncertainty_score":0.9999959,"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."}}