Académique Documents
Professionnel Documents
Culture Documents
University Womens Polytechnic, Faculty of Engineering & Technology, Aligarh Muslim University Aligarh, U.P.
- 202002, India
jahangiralam@zhcet.ac.in
2
ABSTRACT
This paper introduces a new class of processor interconnection topology called LEA
(Linearly Extendable ARM). The attractive properties of LEA topology include
constant degree, moderate diameter, regularity, symmetry, scalability and simple
routing. LEA, when used as one of the components of an interconnection topology
based on product graphs, is capable of maintaining the constant degree over a large
number of nodes. Moreover, product networks based on LEA are not only highly
scalable but also outperform other topologies of interest when either the degree x
diameter or diameter x number of links is used as a desirable quality measure of an
interconnection network. To prove the superiority of LEA, a product network based
on it, has been compared with a number of topologies of interest. A simple routing
algorithm has also been presented for the proposed topology.
Keywords: Interconnection Networks, Twisted Hypercube, Degree, Diameter,
Scalability, Linearly Extendable Arm (LEA), Hybrid Topology.
1. INTRODUCTION
The possibility of interconnecting a large number
of processors together to solve complex problems in
scientific computations has been extensively
addressed in the past. The performance of a parallel
system is strongly affected by the underlying
intercommunication network and the matching of the
algorithms with the network topology. Many
interconnection network topologies have been
Volume 5 Number 2
Page 40
www.ubicc.org
Volume 5 Number 2
Page 41
www.ubicc.org
Volume 5 Number 2
P2
P4
P6
P8
P10
P12
P14
P16
P1
P3
P5
P7
P9
P11
P13
P15
P17
m
2
3
4
5
N=
6*m
12
18
24
30
6k
8k = (8 x k) = (4 x 6k)/3 = 1.34N
Page 42
www.ubicc.org
P6
P12
P1
P7
P13
P2
P8
P14
P3
P9
P15
P4
P10
P16
P5
P11
P17
d(LEA) =
i =1
j=1
d(i, j)
N(N 1)
, where i j
dv =
N
j=1
d(i, j)
No. of
Nodes
12
18
24
6k
d1
(1+1+1+1+2+2+2+2+2+3+3)/11 =
(4x1+5x2+2x3)/11 = 20/11
(1+1+1+1+2+2+2+2+2+2+3+3+3+3+3
+4+4)/17 =
(4x1+6x2+5x3+2x4)/17=39/17
(4x1+6x2+6x3+5x4+2x5)/23
(4x1+6x2+6x3+ +6x(k1)+5xk+2x(k+1)/(6k-1)
m(3m + 4)
(6m 1)
Proceeding in the same manner we can prove
that average distance of each node is given by the
same formula. This is also evident from the fact that
LEA is a 4-regular, node symmetric graph.
Now, the average distance of LEA graph i.e.
d(LEA) could be calculated as follows.
Volume 5 Number 2
m(3m + 4)
(6m 1)
d1 =
d(i, j)
, where i j
N 1
Average Distance of LEA can be calculated as
follows. The average distances for node 1 in different
level LEA networks are shown in the following table:
m
N
j=1
N(N 1)
d(G) =
i =1
Page 43
www.ubicc.org
m+1
m+2
Volume 5 Number 2
Page 44
www.ubicc.org
end for
spl spl + 1;
end while
for i=1 to 4 do
if ((Li) = Pd) then sp Li;
end for
forward(sp);
end
X2
X3
X4
L1
L2
L3
L4
Spl
16
P2P17P16
P2P5P8
P2P3P4
P2P1P0
15
11
17
P2P17P16P15
P2P5P8P11
P2P3P4P5
P2P1P0P17
DLH(m, n)
[14]
Hype r-Mesh
HM(n,r,c)
[2]
Hex-cell
HC(i)
[3]
LEAH(m, n)
No. of Nodes
(N)
m.2 n+2
(r.c).2 n
6(2i-1)
3m.2 n+1
Degree (d)
3+n
4+n
Diameter (D)
m+n+1
n+r+c-2
m+n+1
No. of Links
(L)
m.2 .(3+n)
2 . (r.c).(4+n)
18i-12
3m.2 .(4+n)
Cost (D x d)
(3+n)(m+n+1)
(n+r+c-2).(n+4)
n+1
n-1
P6
P4
P15
P1
P14
P5
P7
P16
P8
P17
P9
P10
P12
P11
P13
Volume 5 Number 2
3.(4
2i 1
(4+n).(m+n+1)
- 1)
n-1
P2
4+n
-1
P0
2i 1
Extended Cost
(L x D)
(m+n+1).
n+1
m.2 .(3+n)
2 .
(r.c).(4+n).(
n+r+c-2)
(4
2i 1
- 1).(18i-12)
(m+n+1).
n
3m.2 .(4+n)
Page 45
www.ubicc.org
topologies).
Figure 6 shows the comparison of diameters for
various topologies as a function of network size
(number of processors). From figure 6 it is obvious
10000
400
1000
300
C ost
500
100
200
10
100
0
1
0
10
2000
4000
LEAH
Figure 5:
Hyper Mesh
Hex-Cell
6000
8000
10000
Number of Nodes
LEAH(m,6)
HC
DLH(m,6)
Hex-Cell
Hyper-Mesh(6,r,c)
160
120
E x te n d e d C o s t
100
D iam eter
700
650
600
550
500
450
400
350
300
250
200
150
100
50
T hous ands
140
80
60
40
20
0
0
2000
4000
6000
8000
10000
2000
4000
6000
8000
10000
DLH(m, 6)
Hex-Cell
Hyper-Mesh(6,r,c)
LEAH(m,6)
Volume 5 Number 2
Number of Nodes
DLH(m,6)
Hex-Cell
Hyper-Mesh(6,r,c)
Page 46
www.ubicc.org
CONCLUSIONS
[10].
[11].
[12].
References
[13].
[14].
Volume 5 Number 2
F. P. Preparata and J. Vuillemin: The cubeconnected cycles: a versatile network for parallel
computation, Communications of the ACM, Vol.
24(5), pp.300-309 (1981).
L. Youyao, H. Jungang, D. U. Huimin: A
Hypercube
Based
Scalable
Interconnection
Network for Massively Parallel System, Journal of
Computers, Vol. 3, No. 10, pp. 58-65 (2008)
[15].
A. Awwad, A. A. Ayyoub and M. OuldKhaoua: On Topological Properties of
Arrangement Star Network, Journal of Systems
Architecture, No. 48, pp. 325-336 (2003).
[16].
K. Day and A. Tripathi: A Comparative
Study of Topological Properties of Hypercubes
and Star Graphs, IEEE Transactions on Parallel
and Distributed Systems, Vol. 5 No. 1, pp. 31-38
(1994).
[17].
S. Zheng, B. Cong and S. Btttayeb: The
Star-Hypercube
Hybrid
Interconnection
Networks, Proceedings of the ISCA International
Page 47
www.ubicc.org
[19].
A. Youssef and B. Narahari: The BanyanHypercube Networks, IEEE Transactions on
Parallel and Distributed Systems, Vol. 1 No. 2,
pp. 160-169 (1990).
[20].
S. K. Das and A. K. Banerjee: Hyper
Perersen Network: Yet Another Hypercube-Like
Topology, Proceedings of Frontiers 92, pp. 270277 (1992).
[21].
G. Chartrand and L. Lesniak: Graph and
Diagraph (Second Edition), Wadsworth &
Books, California, (1986).
[22].
[23].
[24].
Volume 5 Number 2
Page 48
www.ubicc.org