{"id":"W2083469609","doi":"10.5555/2133429.2133470","title":"Credit borrow and repay: sharing DRAM with minimum latency and bandwidth guarantees","year":2010,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Dram; Latency (audio); Computer network; Cache; Quality of service; Scheduling (production processes); Bandwidth (computing); CAS latency; Distributed computing; Operating system; Computer hardware; Memory controller; Telecommunications","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.000362339,0.0002349931,0.0002076529,0.0002230994,0.000160519,0.000768179,0.0008860177,0.00009263927,0.00002423361],"category_scores_gemma":[0.00003342138,0.000197267,0.00002888455,0.0001316599,0.0001171421,0.0005003001,0.000339357,0.0003161549,0.000008267501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001537038,"about_ca_system_score_gemma":0.00007439272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002278304,"about_ca_topic_score_gemma":0.00000613035,"domain_scores_codex":[0.9984197,0.00004757661,0.0002716696,0.0006909748,0.0003415868,0.0002284877],"domain_scores_gemma":[0.998859,0.0001749124,0.0001421855,0.0004082086,0.0002969453,0.0001186991],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003040645,0.0003369725,0.006556259,0.00004193114,0.0002288513,0.0002468429,0.002173407,0.00451389,0.005910852,0.8220335,0.006122801,0.1515306],"study_design_scores_gemma":[0.0005433527,0.0003918672,0.00261746,0.0001107745,0.000005108202,0.0001472528,0.000004612979,0.9752821,0.001392005,0.0187964,0.000411529,0.0002975691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0261553,0.000017645,0.9685434,0.001551537,0.0005306341,0.0001890079,0.000002206578,0.0004157042,0.002594551],"genre_scores_gemma":[0.6151122,0.00003230264,0.3841596,0.0003696634,0.0001282687,0.00001246154,0.000003415157,0.00001007709,0.0001720729],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9707682,"threshold_uncertainty_score":0.8044316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03214478053717342,"score_gpt":0.2695137968092831,"score_spread":0.2373690162721096,"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."}}