{"id":"W2060927838","doi":"10.4028/www.scientific.net/amr.268-270.2101","title":"A High-Performance Scheduling Algorithm for Buffered Crossbar Switch","year":2011,"lang":"en","type":"article","venue":"Advanced materials research","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Faculty of Graduate Studies and Research, University of Alberta","keywords":"Computer science; Scheduling (production processes); Weighted fair queueing; Scalability; Round-robin scheduling; Quality of service; Maximum throughput scheduling; Queueing theory; Crossbar switch; Distributed computing; Fair queuing; Dynamic priority scheduling; Algorithm; Computer network; Mathematical optimization; Mathematics; Operating system","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002036475,0.0001641486,0.0002973768,0.0001789202,0.0004776815,0.0003238816,0.000988496,0.000110817,0.0001006741],"category_scores_gemma":[0.00008728181,0.0001428851,0.00004421658,0.0003673317,0.00007544702,0.0008136418,0.0003077491,0.0001637775,0.000153388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000786656,"about_ca_system_score_gemma":0.00007317132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001410688,"about_ca_topic_score_gemma":0.000006151211,"domain_scores_codex":[0.9976434,0.0001747214,0.0004260962,0.0005455084,0.0004088814,0.000801445],"domain_scores_gemma":[0.998356,0.0001588993,0.00009202473,0.0006574461,0.0006191274,0.0001164424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003279368,0.0002000204,0.00003395746,0.0002827294,0.00007220575,0.00002626595,0.001912064,0.0005674773,0.5952318,0.08043487,0.0006540381,0.3202567],"study_design_scores_gemma":[0.001017756,0.0005900824,0.0002254698,0.0001363914,0.00000206597,0.00002133008,0.00008893429,0.0460952,0.9418724,0.006921343,0.002739033,0.0002900394],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4429278,0.00006256319,0.5538159,0.00005875051,0.00204486,0.0005982079,0.00001230509,0.0001398975,0.0003397165],"genre_scores_gemma":[0.7607251,0.00005039178,0.2377678,0.00003691852,0.0003541608,0.0003951357,0.000005306941,0.00002233901,0.0006428214],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3466406,"threshold_uncertainty_score":0.5826684,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08750407750242112,"score_gpt":0.3408157325870561,"score_spread":0.2533116550846349,"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."}}