{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000538091,0.0006493225,0.0004494733,0.0006748864,0.0007996224,0.000779632,0.001084236,0.0004845471,0.002884228],"category_scores_gemma":[0.0008814126,0.0002879691,0.0002472289,0.0007705314,0.0003262056,0.0008084506,0.0005916195,0.0004697409,0.0004716258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00116117,"about_ca_system_score_gemma":0.001208262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003706186,"about_ca_topic_score_gemma":0.002962689,"domain_scores_codex":[0.9997461,0.00005007602,0.00001901632,0.00006547615,0.00008024524,0.00003897716],"domain_scores_gemma":[0.9998092,0.00004720944,0.00002045621,0.00002185774,0.00008122291,0.00002012371],"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.0004287502,0.0001234559,0.000683259,0.0001582335,0.00006092592,0.000128431,0.0001798566,0.5271392,0.02927365,0.04495573,0.006297122,0.3905712],"study_design_scores_gemma":[0.00004781806,0.0000441691,0.00007850651,0.000005451916,0.000008699202,0.0000272464,0.00001209069,0.9889264,0.003258363,0.005506671,0.002075923,0.000008650672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01202475,0.000220617,0.9850189,0.00009858927,0.00008641431,0.00007177168,0.00004090859,0.0008163078,0.001621824],"genre_scores_gemma":[0.3562983,0.0002950017,0.6390401,0.00009842936,0.00007898521,0.000196859,0.000223581,0.0001101916,0.003658506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003706186,"threshold_uncertainty_score":0.00964874,"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."}}