{"id":"W2243101714","doi":"","title":"Task Scheduling for Highly Concurrent Analytical and Transactional Main-Memory Workloads","year":2013,"lang":"en","type":"article","venue":"Infoscience (Ecole Polytechnique Fédérale de Lausanne)","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Transactional memory; Exploit; Distributed computing; Context switch; Scheduling (production processes); Concurrency control; Concurrency; Parallel computing; Granularity; Thread (computing); Operating system; Database transaction; Database","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.0009426627,0.0002854401,0.0003344642,0.0002289787,0.0003947112,0.0006649183,0.001200656,0.0001972689,0.00002532274],"category_scores_gemma":[0.0001169615,0.0002823256,0.0001392832,0.000694907,0.0002848677,0.000935159,0.0001742769,0.0003076189,0.00003967246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001299697,"about_ca_system_score_gemma":0.0003202165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001355617,"about_ca_topic_score_gemma":0.00001059204,"domain_scores_codex":[0.9974099,0.00008905289,0.0005189568,0.0007056008,0.0004071808,0.0008692931],"domain_scores_gemma":[0.9984032,0.0003446511,0.0001775617,0.0004930971,0.0001799035,0.0004015778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000669061,0.0009396081,0.01008434,0.0006111887,0.0001649464,0.00007809175,0.003034636,0.02560097,0.04283675,0.4822573,0.04401946,0.3903058],"study_design_scores_gemma":[0.0006594806,0.0003125406,0.004323841,0.0002419204,0.00001572015,0.000160169,0.00007900018,0.9723383,0.003910482,0.006077857,0.01120618,0.0006744763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03968167,0.0001872394,0.9553614,0.001800657,0.0005463735,0.0008778982,0.00003218351,0.0004585995,0.001054034],"genre_scores_gemma":[0.9213088,0.00001764519,0.07689419,0.0007381747,0.0001581917,0.0003285627,0.000008234403,0.00001406109,0.0005321481],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9467373,"threshold_uncertainty_score":0.9999629,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01339405943242297,"score_gpt":0.2510090254359053,"score_spread":0.2376149660034823,"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."}}