{"id":"W2091270106","doi":"10.1145/2043662.2043664","title":"Demand Paging Techniques for Flash Memory Using Compiler Post-Pass Optimizations","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Nexen (Canada)","funders":"National Research Foundation of Korea","keywords":"Demand paging; Computer science; Paging; Page fault; Embedded system; Executable; Virtual memory; Flat memory model; Compiler; Operating system; Overhead (engineering); Code (set theory); Page; Memory management; Memory map; Computer hardware; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008432805,0.0004162257,0.0004928113,0.0005923726,0.001056185,0.0003447779,0.001672763,0.0002178322,0.000009051746],"category_scores_gemma":[0.0000679052,0.00043345,0.000243348,0.000743584,0.00007972914,0.0005035416,0.00007425798,0.0003238088,0.00001365691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001603291,"about_ca_system_score_gemma":0.000135949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001061413,"about_ca_topic_score_gemma":0.000002926037,"domain_scores_codex":[0.9971066,0.000276827,0.0008216217,0.0008310648,0.0003542328,0.0006096602],"domain_scores_gemma":[0.9969887,0.0004224748,0.0003893001,0.001437373,0.0005889374,0.0001732586],"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.00004472401,0.0004501114,0.00004745794,0.0001713013,0.0002087163,0.0000109068,0.005885852,0.9595007,0.0009491736,0.004654291,0.0007144558,0.02736233],"study_design_scores_gemma":[0.0004409998,0.0002164224,0.00002642295,0.0002937746,0.00004726718,0.00009098251,0.0002577764,0.9890534,0.008199605,0.0005489076,0.0002875582,0.0005368646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00167053,0.00009242731,0.9917773,0.0001063031,0.001028422,0.001127624,0.00001733126,0.002810319,0.001369765],"genre_scores_gemma":[0.4026919,0.000008248017,0.5967735,0.0002015944,0.00008626068,0.0000587032,0.000008122735,0.00004282853,0.0001288385],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4010214,"threshold_uncertainty_score":0.9998117,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04810123023841485,"score_gpt":0.2834237127626531,"score_spread":0.2353224825242383,"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."}}