Constructing Edge-Colored Graph for Heterogeneous Networks
Constructing Edge-Colored Graph for Heterogeneous Networks作者机构：School of Computer Science and Software Engineering Tianjin Polytechnic University Tianjin 300387 China State Key Laboratory of Computer Architecture~ Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Department of Computer Science University of Otago Dunedin 9054 New Zealand
出 版 物：《Journal of Computer Science & Technology》 (计算机科学技术学报（英文版）)
年 卷 期：2015年第30卷第5期
页 面：1154-1160页
核心收录：
学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 08[工学] 070104[理学-应用数学] 081201[工学-计算机系统结构] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）]
基 金：the National Natural Science Foundation of China under Grant Nos. 61173032 and 61202062 the National Natural Science Foundation of China (Tianyuan Special Foundation) under Grant Nos. 11326211 and 11326198 the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 20131201110002 and the Key Laboratory of Computer Architecture Opening Topic Fund Subsidization under Grant No. CARCH201303
主 题：network reliability homogeneous fault fault tolerance reconfigurable system network-on-chip
摘 要：In order to build a fault-tolerant network, heterogeneous facilities are arranged in the network to prevent homogeneous faults from causing serious damage. This paper uses edge-colored graph to investigate the features of a network topology which is survivable after a set of homogeneous devices malfunction. We propose an approach to designing such networks under arbitrary parameters. We also show that the proposed approach can be used to optimize inter-router connections in network-on-chip to reduce the additional consum!otion of energy and time delay.
维普期刊数据库