{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003062716,0.0002817572,0.0003935169,0.0003543261,0.0005355505,0.0009226679,0.00126234,0.000451273,0.0004342193],"category_scores_gemma":[0.007228171,0.0004478848,0.0002280892,0.0006383242,0.00105017,0.00166582,0.0006121729,0.0006365775,0.00008198763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006245351,"about_ca_system_score_gemma":0.001287789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002144229,"about_ca_topic_score_gemma":0.001787158,"domain_scores_codex":[0.9986203,0.0006486631,0.00009732002,0.000106943,0.0004100946,0.0001166628],"domain_scores_gemma":[0.9963518,0.002111613,0.0004020646,0.000541778,0.000448397,0.0001443686],"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.001239716,0.0003722447,0.004153124,0.0002407623,0.00007608388,0.0004134777,0.0005789024,0.7583225,0.02904807,0.07157926,0.001317233,0.1326586],"study_design_scores_gemma":[0.0001080478,0.0002680272,0.0002587361,0.00000696707,0.00002229598,0.00007348822,0.0000401872,0.9812528,0.004929035,0.01225054,0.0007721882,0.00001758524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3393265,0.002041683,0.6545926,0.0005304609,0.0002186808,0.0001014528,0.00002437787,0.0005127487,0.002651549],"genre_scores_gemma":[0.952546,0.0002448559,0.04656658,0.00003942637,0.00005889882,0.00003412276,0.00001066707,0.00002207838,0.0004773677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003062716,"threshold_uncertainty_score":0.01619732,"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."}}