![]() Path length len(P(u,v)), is the number of edges P(u,v).ĭistance between vertices u and v, dist G(u,v), is the length of a shortest path joining u and v.Īverage distance in G, dist G(u,v), is \Sigma u,vdist G(u,v)/(N(N-1)).ĭiameter of G, diam(G), is the maximum distance between any two vertices of G. K-regular graph G has \triangle(G)=\delta(G)=k.Ĭonnected graph Every pair u, v of vertices is joined by a path P(u,v), a sequence of adjacent edges. Minimum degree of G is \delta(G)=min(deg(G)). Maximum degree of G is \triangle(G)=max(deg(G)). This section is devoted to the description and analysis of topologies and properties of important INs.īack to the beginning of the page Back to the CS838 class schedule Basic notions and terminology Alphabets and strings d-ary alphabet is denoted by Z d=. A processing node (PN) usually consists of one or more processors, local memory, and communication router. Requirements on interconnection networksĪ direct interconnection network (IN) of a multiprocessor system is represented by a connected graph whose vertices represent processing nodes and edges represent communication links.Direct interconnection networks I+II Section#5: Direct interconnection networks I+II
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |