陈贵海
对等计算、传感器网络、网格计算、高性能计算机系统结构、组合数学
个性化签名
- 姓名:陈贵海
- 目前身份:
- 担任导师情况:
- 学位:
-
学术头衔:
博士生导师
- 职称:-
-
学科领域:
计算机系统结构
- 研究兴趣:对等计算、传感器网络、网格计算、高性能计算机系统结构、组合数学
陈贵海,南京大学教授、博导。1984年获南京大学计算机软件专业学士学位,1987年获东南大学计算机应用专业硕士学位,1997年获香港大学博士学位,1998.10-1999.3任日本九州工业大学访问教授,1999.6-1999.9任香港大学研究员,2000.5-2000.8任澳洲昆士兰大学访问教授,2001.9-2003.8受聘于美国韦恩州立大学担任访问教授。主要研究方向包括对等计算、传感器网络、网格计算、高性能计算机系统结构、组合数学等。主持或协助主持过国家自然科学基金、863高科技、国家攀登计划等课题。
已发表论文近100篇,其中国际刊物及国际学术会议论文30余篇,被SCI,EI,ISTP收录的论文40余篇。部分成果已发表在IEEE Transactions on Parallel & Distributed Systems,The Computer Journal,Computer Communications,Information Systems, International Journal of Foundations of Computer Science,International Journal of Performance Evaluation等国际著名杂志上,受到了国际同行的普遍关注,多次应邀担任国际学术会议的程序委员、分会主席或大会主席。现任中国计算机学会开放系统专委会秘书长。曾获奖励包括2000年江苏省科技成果二等奖,2000年江苏省青蓝工程跨世纪学术带头人,2001年江苏省教学成果二等奖,2002年教育部高校青年教师奖,2003年国家自然科学基金委员会项目特优评价,2004年中创软件人才奖,2004年南京市留学回国人员先进个人等。
-
主页访问
3279
-
关注数
0
-
成果阅读
531
-
成果数
12
陈贵海, 杜鹏, 王大进, , 谢立
电子学报,2004,32(2),-0001,():
-1年11月30日
矩形无效块模型可以用来解决网格下的容错路由问题,最小连接块(MCC)模型是它的一个改良模型。本文在MCC基础上,建立MCC 重叠图,当发现不存在曼哈顿路径的时候,给出一套算法,来计算出一条避免无效块的尽可能短的路径。模拟试验表明,通过这种算法找到的路径,与最短路径相差很小。相比起花费更多的时间去找寻最短路径,这种启发式容错算法无疑是更好的选择。
自适应路由, 矩形无效块模型, 容错性, 网格
-
68浏览
-
0点赞
-
0收藏
-
0分享
-
252下载
-
0评论
-
引用
【期刊论文】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.,
-
31浏览
-
0点赞
-
0收藏
-
0分享
-
96下载
-
0评论
-
引用
【期刊论文】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评论
-
引用
【期刊论文】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评论
-
引用
【期刊论文】Tighter Layouts of the Cube-Connected Cycles
陈贵海, Guihai Chen, and Francis C.M. Lau, Member, IEEE
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 11, NO.2, FEBRUARY 2000,-0001,():
-1年11月30日
Preparata and Vuillemin proposed the cube-connected cycles (CCC) and its compact layout in 1981[17]. We give a new layout of the CCC which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the CCC. The area of the new layout deviates from this bound by a small constant factor. If we "unfold" the cycles in the CCC, the resulting structure can be laid out in optimal area.
Interconnection networks,, cube-connected cycles,, VLSI,, embedding,, routing,, layout.,
-
45浏览
-
0点赞
-
0收藏
-
0分享
-
63下载
-
0评论
-
引用
-
48浏览
-
0点赞
-
0收藏
-
0分享
-
53下载
-
0评论
-
引用
【期刊论文】USING VISUAL SPATIAL SEARCH INTERFACE FOR WWW APPLICATIONS
陈贵海, XIAOFANG ZHOU, , JOSEPH D. YATES, and GUIHAI CHEN
Informution Systems Vol. 26, No.2, pp. 61-74,200l,-0001,():
-1年11月30日
Most Internet search engines are keyword-based. They are not efficient for the queries where geographical location is important, such as finding hotels within an area or close to a place of interest. A natural interface for spatial searching is a map, which can be used not only to display locations of search results but also to assist forming search conditions. A map-based search engine requires a well-designed visual interface that is intuitive to use yet flexible and expressive enough to support various types of spatial queries as well as aspatial queries. Similar to hyperlinks for text and images in an HTML page, spatial objects in a map should support hyperlinks. Such an interface needs to be scalable with the size of the geographical regions and the number of websites it covers. In spite of handling typically a very large amount of spatial data, a map-based search interface should meet the expectation of fast response time for interactive applications. In this paper we discuss general requirements and the design for a new map-based web search interface, focusing on integration with the WWW and visual spatial query interface. A number of current and fuhrre research issues are discussed, and a prototype for the University of Queensland is presented.
WWW,, Spatial Search Interface,, Map-Based Search
-
29浏览
-
0点赞
-
0收藏
-
0分享
-
47下载
-
0评论
-
引用
【期刊论文】Layout of the Cube-connected Cycles without Long Wires
陈贵海, GUIHAI CHEN, AND FRANCIS C. M. LAU
THE COMPUTER JOURNAL, Vol. 44, No.5, 2001,-0001,():
-1年11月30日
Preparata and Vuillemin proposed the cube-connected cycles (CCC) in 1981, and in the same paper gave an asymptotically-optimal layout scheme for the CCC. While all the known optimal layouts of the CCC, including the Preparata–Vuillemin layout, have long wires, we give a new layout scheme which has no long wires while keeping the asymptotically-optimal area. Hence, we can conclude that the CCC can be laid out optimally (within a constant factor) both in area and in wire length. We also show how large a constant-factor blow-up in area is needed in order not to produce any long wire in the layout.
-
50浏览
-
0点赞
-
0收藏
-
0分享
-
54下载
-
0评论
-
引用
【期刊论文】P2P Overlay Networks of Constant Degree
陈贵海, Guihai Chen, , Chengzhong Xu, Haiying Shen, and Daoxu Chen
GCC 2003, LNCS 3032, pp. 412-419, 2004.,-0001,():
-1年11月30日
This paper proposes an abstract and generic topological model that captures the essence of P2P architecture. Such model should in return facilitate the exploitation of the new design space for more novel P2P systems. The paper also proposes a variant of the cube-connected cycles as a P2P overlay network that achieves O(log N) path length with O(1) neighbors. The simulation result has shown that our system is no worse than other systems of the same complexity such as Viceroy and Koorde.
-
34浏览
-
0点赞
-
0收藏
-
0分享
-
108下载
-
0评论
-
引用