scholarly journals Multiprocessor interconnection networks using partitioned optical passive star (POPS) topologies and distributed control

2002 ◽  
Author(s):  
D.M. Chiarulli ◽  
S.P. Levitan ◽  
R.P. Melhem ◽  
J.P. Teza ◽  
G. Gravenstreter
Keyword(s):  
Distributed Control ◽  
Interconnection Networks ◽  
Multiprocessor Interconnection Networks ◽  
Multiprocessor Interconnection

Partitioned optical passive star (POPS) multiprocessor interconnection networks with distributed control

1996 ◽  
Vol 14 (7) ◽  
pp. 1601-1612 ◽  
Author(s):  
D.M. Chiarulli ◽  
S.P. Levitan ◽  
R.P. Melhem ◽  
J.P. Teza ◽  
G. Gravenstreter
Keyword(s):  
Distributed Control ◽  
Interconnection Networks ◽  
Multiprocessor Interconnection Networks ◽  
Multiprocessor Interconnection

Performance of multiprocessor interconnection networks

Computer ◽  
1989 ◽  
Vol 22 (2) ◽  
pp. 25-37 ◽  
Author(s):  
L.N. Bhuyan ◽  
Qing Yang ◽  
D.P. Agrawal
Keyword(s):  
Interconnection Networks ◽  
Multiprocessor Interconnection Networks ◽  
Multiprocessor Interconnection

MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS

2009 ◽  
Vol 20 (05) ◽  
pp. 941-963 ◽  
Author(s):  
DRAGOŠ CVETKOVIĆ ◽  
TATJANA DAVIDOVIĆ
Keyword(s):  
Interconnection Networks ◽  
Recent Literature ◽  
Vertex Degree ◽  
Multiprocessor Systems ◽  
Undirected Graphs ◽  
Graph Invariants ◽  
Connected Graphs ◽  
Multiprocessor Interconnection Networks ◽  
Related Graph ◽  
Multiprocessor Interconnection

Homogeneous multiprocessor systems are usually modelled by undirected graphs. Vertices of these graphs represent the processors, while edges denote the connection links between adjacent processors. Let G be a graph with diameter D, maximum vertex degree Δ, the largest eigenvalue λ1 and m distinct eigenvalues. The products mΔ and (D+1)λ1 are called the tightness of G of the first and second type, respectively. In recent literature it was suggested that graphs with a small tightness of the first type are good models for the multiprocessor interconnection networks. In a previous paper we studied these and some other types of tightness and some related graph invariants and demonstrated their usefulness in the analysis of multiprocessor interconnection networks. We proved that the number of connected graphs with a bounded tightness is finite. In this paper we determine explicitly graphs with tightness values not exceeding 9. There are 69 such graphs and they contain up to 10 vertices. In addition we identify graphs with minimal tightness values when the number of vertices is n = 2,…, 10.

Fault impact and fault tolerance in multiprocessor interconnection networks

1992 ◽  
Vol 8 (5) ◽  
pp. 485-500 ◽  
Author(s):  
Bernard Menezes ◽  
Allen M. Johnson ◽  
Miroslaw Malek ◽  
Roy Jenevein ◽  
Kitty H. Yau
Keyword(s):  
Fault Tolerance ◽  
Interconnection Networks ◽  
Multiprocessor Interconnection Networks ◽  
Multiprocessor Interconnection
Sign in / Sign up

Export Citation Format

Share Document