{"id":"W159231793","doi":"10.5555/2349508.2349538","title":"Priority-based scheduling with adaptive speculative locking in distributed real-time transaction processing","year":2009,"lang":"en","type":"article","venue":"Summer Computer Simulation Conference","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Workload; Concurrency control; Distributed computing; Transaction processing; Database transaction; Scheduling (production processes); Earliest deadline first scheduling; Optimistic concurrency control; Two-phase locking; Serializability; Distributed transaction; Real-time computing; Dynamic priority scheduling; Computer network; Rate-monotonic scheduling; Operating system; Distributed concurrency control; Database; Mathematical optimization","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002705934,0.0003132583,0.0003880574,0.0001945156,0.0001818445,0.0004091042,0.0004585919,0.0001173115,0.000007760003],"category_scores_gemma":[0.000008353877,0.0002931601,0.00006225208,0.001004548,0.00004777418,0.001169641,0.000026753,0.0002660828,0.00001390133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001606715,"about_ca_system_score_gemma":0.0002661458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005499478,"about_ca_topic_score_gemma":0.00002393416,"domain_scores_codex":[0.9977419,0.0001566962,0.0004963308,0.0007256743,0.0004566064,0.0004227892],"domain_scores_gemma":[0.9986009,0.0001197843,0.0002793311,0.0003902123,0.000491972,0.0001178152],"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.00007575123,0.0001166043,0.001250279,0.00001801233,0.00000980333,0.00002690991,0.0006636425,0.921878,0.0001901197,0.003241837,0.00000267852,0.07252641],"study_design_scores_gemma":[0.001157693,0.0002061348,0.03229662,0.0004382034,0.000007221194,0.000002996397,0.00001962481,0.9646982,0.0002330392,0.0004909105,0.00007868106,0.0003706742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0442364,0.00002361192,0.9543264,0.0003510619,0.0000952539,0.0004127828,0.00001311147,0.0002657715,0.0002756339],"genre_scores_gemma":[0.907291,0.000001114258,0.0924494,0.0001120585,0.00007096418,0.000008369601,0.00004871604,0.000009939798,0.00000842319],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8630546,"threshold_uncertainty_score":0.9999521,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02913185837632737,"score_gpt":0.2747924999949116,"score_spread":0.2456606416185843,"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."}}