{"id":"W2139428553","doi":"10.1145/1120725.1120951","title":"Scalable interprocedural register allocation for high level synthesis","year":2005,"lang":"en","type":"article","venue":"","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Register allocation; Speedup; Scalability; Parallel computing; Relation (database); Context (archaeology); Theoretical computer science; Programming language; Compiler","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.0004116377,0.0001198037,0.0001503354,0.00009838195,0.00006622276,0.0001531992,0.0007767453,0.00007445453,0.00002462045],"category_scores_gemma":[0.0001163076,0.0001018176,0.00005559804,0.0001429513,0.00002101609,0.000797991,0.00009977516,0.00004643908,0.00009695051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001095719,"about_ca_system_score_gemma":0.00004722525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007146181,"about_ca_topic_score_gemma":0.00005597766,"domain_scores_codex":[0.9989565,0.00003577114,0.0002733117,0.0003411004,0.0001625078,0.0002307972],"domain_scores_gemma":[0.9989925,0.0001721908,0.00008838411,0.0005669545,0.0001376497,0.00004230964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001478314,0.00008645556,0.00006807128,0.00008463572,0.00002655905,9.228298e-7,0.0004921001,0.00002000955,0.0152044,0.6704213,0.1588504,0.1547303],"study_design_scores_gemma":[0.0002589055,0.0001287504,0.0002494498,0.0001450488,0.00001133437,0.00004072071,0.00003870852,0.09813487,0.862415,0.02013383,0.01796776,0.0004756397],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001154495,0.00002406843,0.987214,0.004941684,0.0001076711,0.0003770193,0.000001868178,0.0006304068,0.005548839],"genre_scores_gemma":[0.5679464,0.000001147379,0.42497,0.0005471901,0.00007536775,0.000201132,7.170259e-7,0.000008258779,0.006249745],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8472106,"threshold_uncertainty_score":0.4152002,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04288532738415877,"score_gpt":0.2774258242034743,"score_spread":0.2345404968193156,"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."}}