{"id":"W2963419150","doi":"10.4230/lipics.disc.2017.4","title":"Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Global Affairs Canada; Israel Science Foundation; University of Toronto","keywords":"Computer science; Algorithm; Overhead (engineering); Reuse; Lock (firearm); Artificial intelligence; Machine learning; Programming language","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.003832404,0.001268938,0.001076758,0.00135419,0.001220541,0.002686512,0.004237603,0.001204237,0.002854717],"category_scores_gemma":[0.01507841,0.001068377,0.001433112,0.002307471,0.002817039,0.00639501,0.004414324,0.002696752,0.001467301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001226219,"about_ca_system_score_gemma":0.002986857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003036164,"about_ca_topic_score_gemma":0.003053003,"domain_scores_codex":[0.996569,0.0007344279,0.0003439676,0.0005701163,0.001319271,0.0004632087],"domain_scores_gemma":[0.988645,0.003366133,0.001001159,0.005392513,0.001241064,0.0003541873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00130139,0.0005934983,0.006842153,0.0004036145,0.0001732634,0.0003348715,0.001049104,0.08421323,0.03942063,0.2279257,0.011887,0.6258554],"study_design_scores_gemma":[0.0004824781,0.0006153015,0.0009306836,0.000090075,0.0001831545,0.0003495026,0.0003466885,0.5693957,0.07478561,0.3092543,0.0434126,0.0001539865],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02364812,0.0002433366,0.9692305,0.0001867713,0.0001720618,0.0001191905,0.00008127485,0.004388276,0.001930498],"genre_scores_gemma":[0.217241,0.000313259,0.7715482,0.0004909065,0.0001196938,0.0004285319,0.0003522671,0.002825091,0.006681046],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004237603,"threshold_uncertainty_score":0.0202679,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03523850705275347,"score_gpt":0.2812569102232373,"score_spread":0.2460184031704839,"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."}}