{"id":"W2008164459","doi":"10.1109/tetc.2015.2398824","title":"Data Allocation for Hybrid Memory With Genetic Algorithm","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Big Data and Digital Economy","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"Division of Computer and Network Systems; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Cache-only memory architecture; Parallel computing; Interleaved memory; Bottleneck; Uniform memory access; Flat memory model; Memory architecture; Static random-access memory; Memory management; Registered memory; Semiconductor memory; Latency (audio); Non-uniform memory access; Embedded system; Computer architecture; Computer hardware","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.0002894479,0.0001204918,0.0001289765,0.000133246,0.0001082132,0.0001338563,0.000867523,0.00003004443,9.813591e-7],"category_scores_gemma":[0.000007481347,0.0001220861,0.00002262512,0.0002140113,0.00002635603,0.0006063945,0.00001712664,0.0001348049,0.000007049757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006485148,"about_ca_system_score_gemma":0.0001212388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005715195,"about_ca_topic_score_gemma":0.0000548254,"domain_scores_codex":[0.998891,0.00002477233,0.0002411509,0.0004615408,0.0001480779,0.0002334785],"domain_scores_gemma":[0.9988906,0.00008477831,0.00006363557,0.0008118983,0.00006588086,0.00008323475],"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.000004882495,0.00007243189,0.00001700732,0.00001229736,0.00001282874,0.000006594238,0.0002146751,0.09413947,0.000001895094,0.0002119708,0.0002576046,0.9050483],"study_design_scores_gemma":[0.0005778736,0.00008530843,0.00004504171,0.00004068532,0.000006295407,0.00002472427,0.0000494787,0.9929219,0.0006651282,0.0007684851,0.004643374,0.0001717179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003370146,0.00003864108,0.9943674,0.0005789243,0.000835832,0.0002032332,0.00003231825,0.0001109155,0.0004625404],"genre_scores_gemma":[0.4579913,0.000004813071,0.5414738,0.0002472812,0.0001423484,0.00001260335,0.000022259,0.00001270283,0.0000929072],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9048766,"threshold_uncertainty_score":0.4978527,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08209833086676656,"score_gpt":0.2968735042650074,"score_spread":0.2147751733982408,"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."}}