{"id":"W4237305187","doi":"10.1109/icpp.2004.1327911","title":"Low-cost register-pressure prediction for scalar replacement using pseudo-schedules","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Register allocation; Computer science; Speedup; Parallel computing; Software pipelining; Register (sociolinguistics); Scalar (mathematics); Schedule; Software; Control flow graph; Algorithm; Reuse; Mathematics; Theoretical computer science; Programming language; Operating system; Engineering","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.0003732231,0.0007637161,0.0003903228,0.0005679192,0.0002832688,0.00037914,0.0009696878,0.0003113808,0.001742348],"category_scores_gemma":[0.003338093,0.0004232847,0.0004024973,0.0005400816,0.0003149919,0.000759453,0.0002237991,0.0004601622,0.0004866994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006659663,"about_ca_system_score_gemma":0.00188091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007160554,"about_ca_topic_score_gemma":0.009112035,"domain_scores_codex":[0.9996415,0.00009904886,0.00001855616,0.00005307638,0.0001617106,0.00002602237],"domain_scores_gemma":[0.9981036,0.0009177417,0.0003397374,0.0002760637,0.0003194309,0.00004342956],"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.0003394371,0.00009951938,0.008582382,0.0001750003,0.00003726337,0.0001162869,0.00007311597,0.7379295,0.02397681,0.005435088,0.002977428,0.2202581],"study_design_scores_gemma":[0.000007431214,0.00003701901,0.0003730322,0.000002580747,0.000004854463,0.00001508122,0.000003126509,0.9932962,0.005063685,0.0008302066,0.0003620062,0.000004720865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1564475,0.000278759,0.8277995,0.0001492415,0.00003584059,0.0001005851,0.0002735981,0.01299852,0.001916413],"genre_scores_gemma":[0.6139306,0.0001348753,0.3841348,0.0000334296,0.00001760175,0.0001151056,0.0004725473,0.0003920281,0.0007688926],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007160554,"threshold_uncertainty_score":0.0142377,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02809111442326008,"score_gpt":0.2828068451508475,"score_spread":0.2547157307275875,"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."}}