{"id":"W2017264709","doi":"10.1007/s11265-006-0001-1","title":"Buffer and Register Allocation for Memory Space Optimization","year":2007,"lang":"en","type":"article","venue":"The Journal of VLSI Signal Processing Systems for Signal Image and Video Technology","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Register allocation; Computer science; Translation lookaside buffer; Cache; Write buffer; Processor register; Parallel computing; CPU cache; Unix; Memory hierarchy; Operating system; Cache algorithms; Memory address; Physical address; Semiconductor memory","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.003123665,0.0001654343,0.0002983934,0.0003954588,0.0003626908,0.0002245604,0.0004770784,0.0001652351,4.992032e-7],"category_scores_gemma":[0.0001115037,0.0001173672,0.00004960132,0.0003214142,0.0001804003,0.000595558,0.00008465056,0.0001868483,1.73021e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003555647,"about_ca_system_score_gemma":0.00007674466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006085571,"about_ca_topic_score_gemma":8.271759e-7,"domain_scores_codex":[0.9986906,0.00007249855,0.0005877911,0.0002066363,0.0001800137,0.000262443],"domain_scores_gemma":[0.9977807,0.0003908171,0.0007721359,0.0001690873,0.0008335762,0.00005362727],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001551126,0.0004063843,0.0002576683,0.002683786,0.0004026201,0.00004375702,0.005481868,0.1303418,0.156582,0.03466812,0.01396201,0.6536189],"study_design_scores_gemma":[0.001019348,0.0009091093,0.00001209268,0.0004262873,0.00008264882,0.0009470073,0.000498776,0.9606548,0.0273986,0.006598897,0.00119919,0.0002532412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001727356,0.005328592,0.9901543,0.002072173,0.00008215024,0.0004463147,9.96656e-7,0.0001315314,0.00005660779],"genre_scores_gemma":[0.7304905,0.0001304366,0.2689381,0.0001208923,0.000146557,0.00001363385,0.000001055236,0.00001781061,0.0001410595],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.830313,"threshold_uncertainty_score":0.4786095,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0154958766341676,"score_gpt":0.2778505323013062,"score_spread":0.2623546556671386,"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."}}