{"id":"W2035420994","doi":"10.1109/aspdac.2015.7058980","title":"A novel approach using a minimum cost maximum flow algorithm for fault-tolerant topology reconfiguration in NoC architectures","year":2015,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Control reconfiguration; Spare part; Computer science; Network topology; Topology (electrical circuits); Fault tolerance; Maximum flow problem; Logical topology; Minimum-cost flow problem; Network on a chip; Distributed computing; Flow network; Algorithm; Embedded system; Computer network; Mathematical optimization; Engineering; Mathematics","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.0005234682,0.0008893158,0.0007870203,0.001143641,0.0006586689,0.0007728084,0.001319114,0.001087752,0.002461568],"category_scores_gemma":[0.001389996,0.000449909,0.0005924656,0.0009550806,0.0004185259,0.001436481,0.0007078706,0.0009714734,0.0004126317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007582703,"about_ca_system_score_gemma":0.0008254073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001528781,"about_ca_topic_score_gemma":0.001786234,"domain_scores_codex":[0.9996423,0.00009502968,0.0000231925,0.0000687952,0.0001341581,0.00003648737],"domain_scores_gemma":[0.9996573,0.0001585894,0.0000410617,0.0000380179,0.000085429,0.00001960704],"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.0001294868,0.0001718664,0.0003616866,0.0001935524,0.00007539486,0.000133254,0.00009238981,0.5535822,0.01955502,0.03232104,0.003732073,0.389652],"study_design_scores_gemma":[0.00001884793,0.00004439101,0.00005016651,0.000007598855,0.000009077724,0.00004842014,0.00000792571,0.9897597,0.002055727,0.006081241,0.001906563,0.00001029308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002694089,0.0001023344,0.9960438,0.00006174156,0.00003315957,0.00003224073,0.00001081478,0.0002274732,0.0007944076],"genre_scores_gemma":[0.08203115,0.0001776301,0.9156644,0.00007724592,0.00005675114,0.0001666659,0.00009765096,0.0001146018,0.001613738],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002461568,"threshold_uncertainty_score":0.008234799,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06941511974427564,"score_gpt":0.2886170239665886,"score_spread":0.219201904222313,"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."}}