{"id":"W4307921918","doi":"10.32920/21463020.v1","title":"Introducing TAM: Time-Based Access Memory","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Interleaved memory; Parallel computing; Uniform memory access; Access time; Static random-access memory; Scalability; Registered memory; Dram; Shared memory; Cache-only memory architecture; CPU cache; Embedded system; Cache; Memory management; Computer hardware; Semiconductor memory; Operating system","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005173117,0.0008760139,0.0004635283,0.0008765908,0.0005804144,0.002368862,0.003006432,0.0009145396,0.01870988],"category_scores_gemma":[0.002301874,0.0002935863,0.000615644,0.001549473,0.0009127338,0.005217472,0.002006361,0.001754914,0.006627741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007181485,"about_ca_system_score_gemma":0.0008842688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007020018,"about_ca_topic_score_gemma":0.0009381035,"domain_scores_codex":[0.9994319,0.0000817014,0.00005130249,0.0001330647,0.0002029186,0.00009901175],"domain_scores_gemma":[0.9989999,0.0001700495,0.000102049,0.0004008354,0.0002558671,0.00007124578],"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.0009252902,0.0001917136,0.001518435,0.0008645912,0.0001260349,0.0004897072,0.0002846392,0.01146119,0.04263422,0.315141,0.0649176,0.5614455],"study_design_scores_gemma":[0.000186555,0.0008134426,0.0005135715,0.0001805077,0.0002352696,0.001264466,0.0001578256,0.1037439,0.08491678,0.115708,0.6921725,0.0001072832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02121811,0.009029301,0.8925747,0.001757123,0.003113976,0.0003690323,0.0008543831,0.01888726,0.05219605],"genre_scores_gemma":[0.3765975,0.006168058,0.5103864,0.003321701,0.001501684,0.0008540718,0.002014844,0.001994176,0.0971615],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01870988,"threshold_uncertainty_score":0.06259072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02409840645081019,"score_gpt":0.2963662504187466,"score_spread":0.2722678439679364,"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."}}