Name
Title | ||
|---|---|---|
On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks |
Abstract | ||
|---|---|---|
Abstract In this article, several schemes are proposed for embedding complete binary trees (CBT) into meshes. All of the proposed methods outperform those in the previous studies. First, a link congestion 1 embedding is achieved. Its expansion ratio is at the lowest level as we know now. Except for this superiority, it also provides another capability for fault tolerance to resist abnormal system faults, thus the embedding structure can be more guaranteed and the node utilization is raised further. Second, a link congestion,1 embedding,with no-bending,constraint,is obtained. This scheme provides efficient CBT embedding,for both,the optical mesh,and general mesh,at the same,time while keeping,those good,properties as the previous,scheme. The last one is an optimal embedding which is applied to a 3D cubic mesh, where the node is almost fully utilized and its link congestion,is 2. 2002 Elsevier Science Inc. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0020-0255(02)00389-4 | Inf. Sci. |
Keywords | Field | DocType |
fault-tolerant embeddings,efficient cbt embedding,previous study,link congestion,embedding structure,previous scheme,optical mesh,general mesh,optimal embedding,node utilization,complete binary tree,cubic mesh,mesh interconnection network,fault tolerant,binary tree | Discrete mathematics,Switched mesh,Polygon mesh,Embedding,Binary tree,Resist,Fault tolerance,Interconnection,Shared mesh,Mathematics | Journal |
Volume | ISSN | Citations |
151, | 0020-0255 | 9 |
PageRank | References | Authors |
0.70 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei-Chen Fang | 1 | 17 | 1.66 |
| Chiun-Chieh Hsu | 2 | 132 | 18.37 |
| Chien-Ming Wang | 3 | 134 | 28.21 |