肖文俊
主要从事网络与复杂系统,并行分布计算和数据处理的研究。
个性化签名
- 姓名:肖文俊
- 目前身份:
- 担任导师情况:
- 学位:
-
学术头衔:
博士生导师
- 职称:-
-
学科领域:
计算机科学技术
- 研究兴趣:主要从事网络与复杂系统,并行分布计算和数据处理的研究。
肖文俊,男,汉族,1950年2月出生。1989年获四川大学博士学位,1990年2月至1991年12月在中国科技大学做博士后,并被评为副教授。1993年在厦门大学破格晋升为教授,1998年晋升为博士生导师。2003年6月调入华南理工大学,现为计算机科学与工程学院教授,博士生导师。1999年1月至12月在荷兰Amsterdam大学作访问学者,研究计算机算法和网络。现为福建省数学会理事。
1982年至1994年从事数学专业代数与图论方向的研究。应用有限群的局部方法、表示论方法和自己独创的方法,完全解决了有限群论中的七个著名问题,这七个问题分别由Podufalov,Glauberman,Mazurov,Peng,Mukhin,Sergienko 和陈重穆提出,同时推广了Thompson,Bender,Glauberman,Baer和Zassenhaus等人的著名定理。自1995年以来从事离散数学,网络和并行分布式计算的研究,已在这些领域做出了高水平的研究成果,并在国际权威杂志(SCI)上发表。从1985年以来在国内外重要学术期刊上发表论文50余篇,其中二十余篇发表在SCI检索刊物上。曾主持和参加五个国家自然科学基金项目,主持五个福建省和广东省自然科学基金项目。已获福建省科协1990-1992年度优秀论文一等奖。独立完成的项目"有限群理论中的几个问题",获国家教委1996年度科技进步三等奖。曾获国务院特殊津贴和厦门大学清源奖。目前主要从事网络与复杂系统,并行分布计算和数据处理的研究。
-
主页访问
2885
-
关注数
0
-
成果阅读
678
-
成果数
20
【期刊论文】Further mathematical properties of Cayley digraphs applied to hexagonal and honey comb meshes
肖文俊, Wenjun Xiao a, , Behrooz Parhami b
Discrete Applied Mathematics 155 (2007) 1752-1760,-0001,():
-1年11月30日
In this paper, we extend known relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups to obtain a number of general results on homomorphism between them. Intuitively, our results correspond to synthesizing altemative, more economical, interconnection networks by reducing the number of dimensions and/or link density of existing networks via mapping and pruning. We discuss applications of these results to well-known and useful interconnection netorks such as hexagonal and honeycomb meshes, including the derivation of provably correct shortest-path routing algorithems for such networks.
Cayley digraphs, Cellular networks, Coset graphs, Diameter, Distributed Systems, Homomorphism, Interconnection networks, Internode distance, Parallel processing, Routing
-
34浏览
-
0点赞
-
0收藏
-
0分享
-
93下载
-
0评论
-
引用
肖文俊, Wenjun Xiao a, b, , Behrooz Parhami c, *
Journal of Computer and System Sciences 73 (2007) 1232-1239,-0001,():
-1年11月30日
Despite numerous interconnection schemes proposed for distributed multicomputing, systematic studies of classes of inter-processor networks, that offer speed-cost tradeoffs over a wide range, have been few and far in between. A notable exception is the study of Cayley graphs that model a wide array of symmetric networks of theoretical and practical interest. Properties established for all, or for certain subclasses of, Cayley graphs are extremely useful in view of their wide applicability. In this paper, we obtain a number of new relationships between Cayley (di) graphs and their subgraphs and coset graphs with respect to subgroups, focusing in particular on homomorphism between them and on relating their internode distances and diameters. We discuss applications of these results to well-known and useful interconnection networks such as hexgonal and honeycomb meshes as well as certain classes of pruned tori.
Cayley digraph, Cellular nelwork, Coset graph, Distributed system, Homomorphism, Interconnection Network, Internode distance, Dianeter,, Parallel Processing
-
21浏览
-
0点赞
-
0收藏
-
0分享
-
74下载
-
0评论
-
引用
【期刊论文】Extended Clustering Coefficients of Small-World Networks
肖文俊, Wenjun Xiao, Yong Qin, , and Behrooz Parhami
ICCS 2007, Part IV, LNCS 4490, pp. 67-73, 2007.,-0001,():
-1年11月30日
The clustering cofficient C of a network, Which is a measure of direct conuectivity between neighbors of the various nodes, ranges from O (for no connectivity) to 1 (for full connectivity). We define ex-tended clustering coefficients C (h) of a small-world network based on nodes that are at distance h from a source node, thus generalizing distance-1 neighborhoods employyed in computing the ordinary cluster-ing coefficient C = C(1). Based on known results about the distance distribution Pb(h) in a network, that is, the probability that a randomly chosen pair of vertices have distance h, we derive and experimentally validate the law Ps(h)C(h)< clogN/N, where c is a small constant that seldom exceeds 1. This result is significant because it shows that the product Ps(h)C(h) is upper-bouded by a value that is considerably smaller than the product of maximum values for Pb(h) and C(h).
-
49浏览
-
0点赞
-
0收藏
-
0分享
-
57下载
-
0评论
-
引用
【期刊论文】Biswapped Networks and Their Topological Properties
肖文俊, Wenjun Xiao, Weidong Chen, , Mingxin He, Wenhong Wei, Behrooz Parhami
,-0001,():
-1年11月30日
In this paper, we propose a new class of interconnection networks, called "biswapped networks" (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simple rule for connectivity that ensures its regularity, modularity, fault tolerance, and algorithmic efficiency. In particular, if the basis network is a Cayley digraph then so is the resulting BSN. Our proposed networks provide a systematic construction strategy for large, scalable, modular, and robust parallel architectures, while maintaining many desirable attributes of the underlying basis network that comprises its clusters. We show how key parameters of a BSN are related to the corresponding parameters of its basis network and obtain a number of results on internode distances, Hamiltonian cycles, and node-disjoint paths. We also discuss the relationship between BSNs and swapped or OTIS networks.
-
47浏览
-
0点赞
-
0收藏
-
0分享
-
75下载
-
0评论
-
引用
肖文俊, Bao-xing CHEN†, Xie-bin CHEN, Ji-xiang MENG & Wen-jun XIAO
Science in China Series A: Mathematics Jul., 2007, Vol. 50, No.7, 1055-1064,-0001,():
-1年11月30日
The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems. Given the number n of nodes, how to construct a DLN which has minimum diameter? This problem has attracted reat attention. A related and longtime unsolved problem is: for any given non-negative integer k, is there an infinite family of k-tight optimal DLN? In this paper, two main results are obtained: (1) for any k 0, the infinite families of k-tight optimal DLN can be constructed, where the number n(k, e, c) of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c. (2) for any k 0, an infinite family of singular k-tight optimal DLN can be constructed.
double loop network,, diameter,, k-tight optimal,, singular k-tight optimal
-
39浏览
-
0点赞
-
0收藏
-
0分享
-
49下载
-
0评论
-
引用
【期刊论文】Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks★
肖文俊, Wenjun Xiao and Behrooz Parhami
TAMC 2006, LNCS 3959, pp. 192-197, 2006,-0001,():
-1年11月30日
In this short communicattion, we extend the known relation-ships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups and obtain some general results on homomor-phism and distance between them. Intuitively, Our results correspond to synthesizing alternative, more economical, interconnection networks by reducing the number of dimensions and/or link density of existing net-works via mapping and pruning. We discuss applications of these results to well-known and useful interconnection networks such as hexagonal and honey comb meshes.
-
28浏览
-
0点赞
-
0收藏
-
0分享
-
49下载
-
0评论
-
引用
【期刊论文】Some results on diameters of Cayley graphs☆
肖文俊, Wenjun Xiao
Discrete Applied Mathematics 154 (2006) 1640 -1644,-0001,():
-1年11月30日
In this note we obtain a simple expression of any finote group by means of its generating set. Applying this result we partly solve a conjecture of Cayley graphs proposed by Babai and Seress. We also obtain some other conclusions on diameters on Cayley graphs.
Finite group, Cayley graph, Diameter
-
24浏览
-
0点赞
-
0收藏
-
0分享
-
30下载
-
0评论
-
引用
【期刊论文】Cayley graphs as models of deterministic small-world networks
肖文俊, Wenjun Xiao a, Behrooz Parhami b, *
Information Processing Letters 97 (2006) 115-117,-0001,():
-1年11月30日
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distin-guishing characteristics of small-world networks has been based on probabilistic methods, with a rather small number of researchers advocating deterministic models. In this paper, we further the study of deferministic small-world networks and show that Cayley graphs may be good models for such networks. Small-world networks based on Cayley graphs possess simple structures and signif-icant adaptability. The Cayley-graph model has pedagogical value and can also be used for desiging and analyzing communication and the other real networks.
Average internode distance, Cayley graph, Clustering cofficient, Interconnection network, Low-diameter network
-
16浏览
-
0点赞
-
0收藏
-
0分享
-
47下载
-
0评论
-
引用
【期刊论文】Some new optimal and suboptimal infinite families of undirected double-loop networks
肖文俊, Bao-Xing Chen, †, Ji-Xiang Meng and Wen-Jun Xiao
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8, 2006, 299-312,-0001,():
-1年11月30日
Let n, s be positive integers such that 2 s<n and s 6= n 2. An undirected double-loop network G(n; 1, s) is an undirected graph (V,E), where V=Zn={0, 1, 2,..., n−1} and E={(i, i+1 (mod n)), (i, i+s (modn)) | i 2 Z}. It is a circulant graph with n nodes and degree 4. In this paper, the sufficient and necessary conditions for a class of undirected double-loop networks to be optimal are presented. By these conditions, 6 new optimal and 5 new suboptimal infinite families of undirected double-loop networks are given.
undirected double-loop networks,, diameter,, optimal,, suboptimal
-
24浏览
-
0点赞
-
0收藏
-
0分享
-
39下载
-
0评论
-
引用
【期刊论文】A NEW ROUTING ALGORITHM FOR THE SHUFFLE-EXCHANGE PERMUTATION NETWORK*
肖文俊, Baoxing CHEN. Wenjun XIAO. Ni DU
Jrl Syst Sci & Complexity (2006) 19: 586-591,-0001,():
-1年11月30日
In this paper, a new routing algorithm is given for the shuffle-exchange permutation network (SEPn). The length of the path between any two nodes given by our algorithm is not more than 11/16n2+O(n), Le., the diameter of SEPn is most 11/16n2+O(n). This improves on a 1/8 (9n2-22n+24) routing algorithm described earlier by S. Latifi and P. K. Srimani. We also show that the diameter of SEPn is more than 2n2-n.
Cayley graph,, fixed degree,, routing,, shuffie-exchange permutation network.,
-
41浏览
-
0点赞
-
0收藏
-
0分享
-
44下载
-
0评论
-
引用