{"id":"W2567395862","doi":"10.1145/2947658","title":"An Adaptive Demand-Based Caching Mechanism for NAND Flash Memory Storage Systems","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"Hong Kong Polytechnic University; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Flash file system; Cache; NAND gate; Embedded system; Flash memory; Exploit; Overhead (engineering); Locality of reference; Memory footprint; Locality; Overlay; Parallel computing; Computer hardware; Distributed computing; Operating system; Computer memory; Computer network; 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.001052119,0.0002935383,0.0004139278,0.0004874298,0.0002898964,0.00009999239,0.001461189,0.0002082244,0.000003249501],"category_scores_gemma":[0.0001434907,0.0002336852,0.0001057751,0.0004111869,0.00006447302,0.001359011,0.00001051353,0.000165122,0.00001807574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006549321,"about_ca_system_score_gemma":0.0003062601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003135283,"about_ca_topic_score_gemma":0.000008222986,"domain_scores_codex":[0.9974034,0.0003961026,0.0005883615,0.0006231311,0.0004449777,0.0005440405],"domain_scores_gemma":[0.9964334,0.001067855,0.0004708429,0.001658124,0.0002891166,0.00008061637],"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.0001433518,0.0002101623,6.820397e-7,0.0001436607,0.0001470378,0.000003851298,0.0001868396,0.7266812,0.09338751,0.1502606,0.0001303324,0.02870473],"study_design_scores_gemma":[0.00124148,0.001931657,0.00000335291,0.0002688999,0.00003692663,0.00002603631,0.0001349479,0.8774019,0.1101479,0.008383785,0.00009120754,0.000331936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001891421,0.0002327193,0.9941404,0.0001878703,0.0005298408,0.001679256,0.00004867543,0.001276921,0.00001283511],"genre_scores_gemma":[0.904966,0.00001630468,0.09406589,0.00001873513,0.00002574285,0.0007347114,0.000004184454,0.00003255804,0.0001358926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9030746,"threshold_uncertainty_score":0.9529408,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02651266147675879,"score_gpt":0.2594698317725862,"score_spread":0.2329571702958274,"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."}}