ROUTING_ALGORITHM

作品数:136被引量:141H指数:5
导出分析报告
相关作者:徐驰张晓林蒋文娟宗鹏葛芬更多>>
相关机构:华中师范大学清华大学湖南大学北京航空航天大学更多>>
相关期刊:更多>>
相关基金:国家自然科学基金国家高技术研究发展计划国家重点基础研究发展计划中国博士后科学基金更多>>
-

检索结果分析

结果分析中...
选择条件:
  • 期刊=Journal of Electronics(China)x
条 记 录,以下是1-4
视图:
排序:
TIMING-DRIVEN MULTICHIP MODULE ROUTING ALGORITHM WITH CROSSTALK CONSIDERATION
《Journal of Electronics(China)》2006年第5期741-744,共4页Chang Yifeng Yang Yintang 
Supported by National Defence Fund of China (No. 41323020204).
This paper presents a timing-driven MultiChip Module (MCM) routing algorithm considering crosstalk, which maximizes routing density while minimizing vias and total wire length. The routing algorithm allows a more glob...
关键词:MultiChip Module (MCM) Routing algorithm CROSSTALK 
THE PN2I NETWORK: A SCALABLE BANYAN NETWORK
《Journal of Electronics(China)》2005年第5期470-477,共8页Chen Zhen Liu Zengji Qiu Zhiliang Tao Xiaoming 
Supported by the National High-Tech Programs(No.2002AAl03062, No.2002AA121061 and No.2003AA103520)the Huawei Technologies Co. (No.YBCN2002001).
To design a Banyan network with an arbitrary even-sized port number, the PN2I network is proposed. The PN2I network can be divided into two classes: the complete and incomplete versions. A simple routing algorithm is ...
关键词:Interconnection networks Banyan networks PN2I networks Routing algorithm 
BALANCE ROUTING TRAFFIC IN GENERALIZED SHUFFLE-EXCHANGE NETWORK
《Journal of Electronics(China)》2005年第4期345-350,共6页ChenZhen LiuZengji QiuZhiliang ChenPeng TaoXiaoming 
Supported by the National High-Tech Programs(No.2002AA103062, No.2002AA121061 and No.2003AA103520) the Huawei Technologies Co. under contract number YBCN2002001.
A methodology is proposed to handle problem that under equiproble address of packet traffic at the input port, Generalized Shuffle-Exchange Network (GSEN) routes traffic unevenly because of the unbalanced routing tags...
关键词:Multistage Interconnection Network (MIN) Generalized Shuffle-Exchange Network (GSEN) Tag-based routing algorithm Moore-Penrose pseudoinverse Linear system Matrix analysis 
ROUTING ALGORITHM FOR THE ROTATION-EXCHANGE NETWORK
《Journal of Electronics(China)》2005年第3期255-260,共6页ChenBaoxing XiaoWenjun 
Supported by the Natural Science Foundation of Fujian Province(No.F0110012) and theScientific Research Foundation of Fujian Provincial Education Department(No.JA03142).
The paper proposes a new routing algorithm for the Rotation-Exchange (REn) network. The length of the path between any two nodes given by the algorithm is not more than (3/8)n2 + O(n), that is, the diameter of REn is ...
关键词:Cayley graph Rotation-Exchange (REn) network Fixed degree ROUTING 
检索报告 对象比较 聚类工具 使用帮助 返回顶部