An optical interconnection network and a modified snooping protocol for the design of large-scale symmetric multiprocessors (SMPs)

2004 ◽  
Vol 15 (12) ◽  
pp. 1093-1104 ◽  
Author(s):  
A. Louri ◽  
A.K. Kodi
Keyword(s):  
Large Scale ◽  
Interconnection Network ◽  
Optical Interconnection ◽  
Symmetric Multiprocessors

Design of a two-layer optical interconnection network with a routing node

2005 ◽  
Author(s):  
Fanmin Kong ◽  
Wencai Jing ◽  
Yimo Zhang ◽  
Feng Tang ◽  
Zhixiang Sun
Keyword(s):  
Interconnection Network ◽  
Optical Interconnection

An optical interconnection network for terabit IP routers

2000 ◽  
Vol 18 (12) ◽  
pp. 2095-2112 ◽  
Author(s):  
H.J. Chao ◽  
Ti-Shiang Wang
Keyword(s):  
Interconnection Network ◽  
Optical Interconnection ◽  
Ip Routers

Optical Matrix Computing of Rearrangeable Optical Interconnection Network in Free Space

2010 ◽  
Vol 37 (7) ◽  
pp. 1762-1771
Author(s):  
杨俊波 Yang Junbo ◽  
李修建 Li Xiujian ◽  
杨建坤 Yang Jiankun ◽  
刘菊 Liu Ju ◽  
苏显渝 Su Xianyu ◽  
...  
Keyword(s):  
Free Space ◽  
Interconnection Network ◽  
Optical Interconnection

scholarly journals Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks (THLNs)

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1066
Author(s):  
Huifeng Zhang ◽  
Xirong Xu ◽  
Qiang Zhang ◽  
Yuansheng Yang
Keyword(s):  
Topological Structure ◽  
Large Scale ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Graph Embedding ◽  
Linear Arrays ◽  
Critical Issues ◽  
Vertex Set ◽  
Network Operation ◽  
Host Graph

It is known widely that an interconnection network can be denoted by a graph G = ( V , E ) , where V denotes the vertex set and E denotes the edge set. Investigating structures of G is necessary to design a suitable topological structure of interconnection network. One of the critical issues in evaluating an interconnection network is graph embedding, which concerns whether a host graph contains a guest graph as its subgraph. Linear arrays (i.e., paths) and rings (i.e., cycles) are two ordinary guest graphs (or basic networks) for parallel and distributed computation. In the process of large-scale interconnection network operation, it is inevitable that various errors may occur at nodes and edges. It is significant to find an embedding of a guest graph into a host graph where all faulty nodes and edges have been removed. This is named as fault-tolerant embedding. The twisted hypercube-like networks ( T H L N s ) contain several important hypercube variants. This paper is concerned with the fault-tolerant path-embedding of n-dimensional (n-D) T H L N s . Let G n be an n-D T H L N and F be a subset of V ( G n ) ∪ E ( G n ) with | F | ≤ n - 2 . We show that for two different arbitrary correct vertices u and v, there is a faultless path P u v of every length l with 2 n - 1 - 1 ≤ l ≤ 2 n - f v - 1 - α , where α = 0 if vertices u and v form a normal vertex-pair and α = 1 if vertices u and v form a weak vertex-pair in G n - F ( n ≥ 5 ).

Sign in / Sign up

Export Citation Format

Share Document