{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001194559,0.0004877072,0.0004140145,0.0003922148,0.0007536066,0.001051964,0.001401825,0.0003831396,0.0008686892],"category_scores_gemma":[0.004527273,0.0003186864,0.0002891573,0.0007033632,0.0004289819,0.001072284,0.0006361515,0.0005245431,0.0003397211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000747057,"about_ca_system_score_gemma":0.001977412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00356552,"about_ca_topic_score_gemma":0.004082552,"domain_scores_codex":[0.9991335,0.0001628452,0.0001065105,0.0001596615,0.0002843512,0.0001531649],"domain_scores_gemma":[0.9977034,0.0008804671,0.0001929104,0.000525087,0.0004526623,0.0002455587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003317582,0.001223419,0.0285118,0.0006933151,0.0001499305,0.0007749801,0.001767591,0.2286086,0.3639016,0.01676174,0.00897971,0.3453098],"study_design_scores_gemma":[0.0001570173,0.0003384646,0.004639234,0.00001518476,0.00004346843,0.0002686361,0.0002691951,0.9321316,0.05021678,0.007068295,0.004819681,0.0000324762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6561701,0.0008276603,0.334597,0.0003904302,0.0001112733,0.0001710119,0.0001646082,0.003259377,0.00430843],"genre_scores_gemma":[0.9243878,0.0001710062,0.07422838,0.00005721542,0.00004920128,0.00005149753,0.0001230399,0.0001690037,0.0007629715],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00356552,"threshold_uncertainty_score":0.007089555,"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."}}