{"id":"W3043382192","doi":"10.1109/isca45697.2020.00024","title":"T4: Compiling Sequential Code for Effective Speculative Parallelization in Hardware","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Compiler; Scalability; Speedup; Exploit; Task parallelism; Automatic parallelization; Spawn (biology); Speculative execution; Multi-core processor; Optimizing compiler; Register file; Computer architecture; Instruction set; Programming language; Parallelism (grammar); Operating system","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.0001616713,0.0001124318,0.0001667017,0.0000647239,0.00007660667,0.00009139777,0.0003539282,0.0000496555,0.000008814094],"category_scores_gemma":[0.0001012706,0.0001099069,0.00005555836,0.0003127556,0.00001766355,0.0003201081,0.0001281954,0.00007978677,0.00001055971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004431823,"about_ca_system_score_gemma":0.00003223471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008489651,"about_ca_topic_score_gemma":0.000009244644,"domain_scores_codex":[0.9990509,0.00008398843,0.0002100218,0.0003622023,0.0001187002,0.0001741676],"domain_scores_gemma":[0.9994943,0.000120289,0.00007164312,0.0001398654,0.0001104705,0.00006340903],"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.00008232959,0.00009397561,0.002035728,0.00007589767,0.00003695744,0.00001285059,0.004661574,0.7077453,0.0008898829,0.2650978,0.004239853,0.01502791],"study_design_scores_gemma":[0.0005056796,0.0001070729,0.0004585609,0.0000183337,0.000002185541,9.547218e-7,0.00001624801,0.9887106,0.005479754,0.002911058,0.001645176,0.0001443479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001494064,0.00002603814,0.9943021,0.001416943,0.00007211397,0.0006383442,0.000004549513,0.0005352476,0.001510578],"genre_scores_gemma":[0.5993064,0.000004576583,0.3997228,0.0008053784,0.00005527244,0.00004220434,0.00001554677,0.000007459967,0.00004039338],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5978123,"threshold_uncertainty_score":0.4481874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0384925187401475,"score_gpt":0.3009201967051305,"score_spread":0.262427677964983,"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."}}