{"id":"W2952192686","doi":"10.48550/arxiv.1709.00700","title":"Generating Custom Code for Efficient Query Execution on Heterogeneous Processors","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Banting and Best Diabetes Centre, University of Toronto; Deutsche Forschungsgemeinschaft; Technische Universität Berlin; European Commission","keywords":"Computer science; Code (set theory); Parallel computing; Multi-core processor; Process (computing); Programming language","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001060512,0.0009103761,0.0005079851,0.0005322339,0.0004750062,0.0009440054,0.002384172,0.0007241592,0.001910587],"category_scores_gemma":[0.00462742,0.0005916799,0.0008575015,0.0008389305,0.00118394,0.001502151,0.001580613,0.001391322,0.0009397088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008068079,"about_ca_system_score_gemma":0.001146593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002203987,"about_ca_topic_score_gemma":0.002565325,"domain_scores_codex":[0.9986058,0.0002303087,0.00009067918,0.0003580736,0.0005276767,0.0001874274],"domain_scores_gemma":[0.9976329,0.0006784025,0.0001655829,0.000947812,0.0004805706,0.00009478965],"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.001088028,0.000487645,0.01279497,0.0004016024,0.0001947771,0.0009446623,0.0006986735,0.4411887,0.155565,0.03583975,0.02146669,0.3293293],"study_design_scores_gemma":[0.00006218062,0.00009675031,0.0008036191,0.000009372912,0.00002473058,0.0001234667,0.00005795888,0.9385388,0.04665841,0.008323726,0.005280982,0.00002009967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2159644,0.0002798606,0.7525765,0.0003156797,0.0001071791,0.0002121218,0.0003388071,0.02487541,0.005329989],"genre_scores_gemma":[0.5382224,0.0001584612,0.4518774,0.0002356868,0.0000434586,0.0002863059,0.001489988,0.005095475,0.002590952],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002384172,"threshold_uncertainty_score":0.006391585,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.076601834118263,"score_gpt":0.2299586069697806,"score_spread":0.1533567728515176,"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."}}