{"id":"W2108934635","doi":"10.1109/mascot.1998.693692","title":"Performance of hard real-time transaction scheduling policies in parallel database systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Database transaction; Distributed computing; Online transaction processing; Dynamic priority scheduling; Scheduling (production processes); Transaction processing; Distributed transaction; Fair-share scheduling; Workload; Compensating transaction; Earliest deadline first scheduling; Database; Rate-monotonic scheduling; Real-time computing; Computer network; Operating system; Quality of service","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":[],"consensus_categories":[],"category_scores_codex":[0.0002722747,0.0001127114,0.0002341152,0.0001096712,0.00004777135,0.00006550545,0.0004144984,0.00005098017,0.00002835044],"category_scores_gemma":[0.0000061494,0.00009945217,0.00003904121,0.0004193239,0.00002498896,0.0007718351,0.00002632683,0.00008205632,0.0000888297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003352041,"about_ca_system_score_gemma":0.00001370326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009808744,"about_ca_topic_score_gemma":0.0000126695,"domain_scores_codex":[0.9988281,0.00004541926,0.0004011584,0.0002454168,0.0002367771,0.0002430946],"domain_scores_gemma":[0.9993115,0.00002850957,0.0001033621,0.0004451823,0.00005541908,0.00005601016],"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.0001429216,0.00192682,0.05047706,0.003089386,0.000182784,0.00009462085,0.01114829,0.5675806,0.1977041,0.1136901,0.009701326,0.04426203],"study_design_scores_gemma":[0.0003319987,0.00004332084,0.003915856,0.0001599712,0.000001863767,0.00001386189,0.00005405405,0.9942986,0.0005422147,0.000002563959,0.0005088244,0.0001268878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7719695,0.0002736824,0.2179534,0.0001916452,0.0002664267,0.0002347351,0.00002123702,0.0001413598,0.008948],"genre_scores_gemma":[0.9876363,0.0002196098,0.01085861,0.00001631355,0.00002947628,0.00001574718,0.000004846223,0.00000533103,0.001213799],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.426718,"threshold_uncertainty_score":0.4055542,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02685103935723553,"score_gpt":0.2353464735270249,"score_spread":0.2084954341697894,"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."}}