{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003426716,0.0003188769,0.0003051389,0.0002429027,0.0006346233,0.0003172677,0.001894262,0.0002892568,0.000001708896],"category_scores_gemma":[0.00008807681,0.0003615522,0.0002129199,0.0001453657,0.00007045356,0.0001211743,0.0009805469,0.0003302785,0.00001403501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000222188,"about_ca_system_score_gemma":0.0002017731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002630957,"about_ca_topic_score_gemma":0.00001080307,"domain_scores_codex":[0.9980609,0.00009487741,0.0002184437,0.001163609,0.0001087188,0.0003534782],"domain_scores_gemma":[0.9977348,0.00008886796,0.0005052281,0.001271309,0.0002832354,0.0001165518],"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.00002047768,0.0000710741,0.00003386247,0.00006034142,0.00002527621,0.00003234423,0.0001150209,0.9834391,0.00002148024,0.01496682,0.0003946911,0.0008194832],"study_design_scores_gemma":[0.0002695669,0.00008805477,0.000013127,0.0001570422,0.00002297507,0.000004051325,0.000004978673,0.9924438,0.001704533,0.004404264,0.0004969698,0.0003906605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1023826,0.00004771732,0.8950463,0.0000753296,0.0004892015,0.0005061486,0.00002298914,0.0006904941,0.0007392251],"genre_scores_gemma":[0.9652428,0.00005485582,0.0335798,0.0001193556,0.0001143726,0.000006922451,0.00002631975,0.0000225445,0.0008330065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8628603,"threshold_uncertainty_score":0.9998837,"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."}}