中国科技论文在线

上传时间

2005年04月18日

【期刊论文】一个针对洗牌交换网的最优路由算法

陈贵海

，-0001，（）：

-1年11月30日

摘要

68浏览
0点赞
0收藏
0分享
178下载
0

引用

上传时间

2005年04月18日

【期刊论文】网格中基于最小连接块的启发式容错路由算法

陈贵海，杜鹏，王大进，，谢立

电子学报，2004，32（2），-0001，（）：

-1年11月30日

摘要

矩形无效块模型可以用来解决网格下的容错路由问题，最小连接块（MCC）模型是它的一个改良模型。本文在MCC基础上，建立MCC 重叠图，当发现不存在曼哈顿路径的时候，给出一套算法，来计算出一条避免无效块的尽可能短的路径。模拟试验表明，通过这种算法找到的路径，与最短路径相差很小。相比起花费更多的时间去找寻最短路径，这种启发式容错算法无疑是更好的选择。

自适应路由，矩形无效块模型，容错性，网格

69浏览
0点赞
0收藏
0分享
252下载
0

引用

上传时间

2005年04月18日

【期刊论文】Optimal Layouts of Midimew Networks

陈贵海， Francis C.M， Lau， Member， IEEE and Guihai Chen

IEEETRANSACTIONS ON PARALLLELAND DISTRIBUTED SYSTEMS. VOL. 7. NO.9, SEPTEMBER 1996，-0001，（）：

-1年11月30日

摘要

Midimew networks[4] are mesh-connected networks derived from a subset of degree-4 circulant graphs. They have minimum diameter and average distance among all degree-4 circulant graphs, and are better than some of the most common topologies for parallel corr puters in terms of various cost measures. Among the many midimew networks, the rectangular ones appear to be most suitable for practical implementation. Unfortunately, with the normal way of laying out these networks on a 2D plane, long cross wires that grow with the size of the network exist. In this paper, we propose ways to lay out rectangular midimew networks in a 2D grid so that the length of the longest wire is at most a small constant. We prove that these constants are optimal under the assumption that rows and columns are moved as a whole during the layout process.

Dilation graph embedding,， interconnection networks,， mesh-connected computers,， midimew networks,， parallel processing,， VLSI.，

32浏览
0点赞
0收藏
0分享
96下载
0

引用

上传时间

2005年04月18日

【期刊论文】Comments on "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four"

陈贵海， Guihai Chen， and Francis C.M. Lau， Member， IEEE

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 8, NO.12, DECEMBER 1997，-0001，（）：

-1年11月30日

摘要

Vadapalli and Srimani[2] have proposed a new family of Cayley graph interconnection networks of constant degree four. Our comments show that their proposed graph is not new but is the same as the wrap-around butterfly graph. The structural kinship of the proposed graph with the de Bruijn graph is also discussed.

Interconnection network,， Cayley graph,， generator,， de Bruijn graph,， butterfly graph,， isomorphism.，

35浏览
0点赞
0收藏
0分享
110下载
0

引用

上传时间

2005年04月18日

【期刊论文】A distance-vector routing protocol for networks with unidirectional links

陈贵海， F.C.M. Laua， *， Guihai Chena， b， Hao Huangb， Li Xieb

Computer Communications 23(2000)418-424，-0001，（）：

-1年11月30日

摘要

We propose a simple distance-vector protocol for routing in networks having unidirectional links. The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol. The protocol comprises two main algorithms, one for collecting "from" information, and the other one for generating and propagating "to" information. Like the RIP protocol, this one can handle dynamic changes and tolerate node and link failures in the network.

Routing algorithm， Distance vector， Directed graph， Undirectional link， Routing information protocol

46浏览
0点赞
0收藏
0分享
106下载
0

引用