3D-FolH-NOC: A New Structure For Parallel Processing and Distributed Systems

3D-FolH-NOC: A New structure for parallel processing and
distributed systems
Teamour Esmaeili
Dep.of Computer Engineering
DareShahr Branch,
Islamic Azad University, Iran
Ghazal Lak
DareShahr Branch,
Akram Noori Rad
DareShahr Branch,
AbstractNetwork on Chip (NoC) has been proposed as a new paradigm for designing System on Chip which supports high
degree of scalability and reusability. NoC, specific parameters such as hardware architecture, topology, switching methods have
a huge impact on performance and the cost of the NoCs. Since the ability of the network to efficiently disseminate information
depends largely on the topology, we especially focus on simulation of the 3D-FolH-NOC(3-dimensional-Folded-Heawood-
Network-on-chip) topology for NoC in different Sizes and dimensions for NoC. We simulate this topology for general-purpose
parallel processing applications. This paper shows that a novel network called the 3D-FolH-NOC(3-dimensional-Folded-
Heawood-Network-on-chip) is universally efficient when adequate capacity distribution is provided and is suitable for use as an
interconnection network in parallel computers.
Index Termsinterconnection network (IN), 3-dimensional-Folded-Heawood-Network-on-chip, Network on Chip (NoC).
~~~~~~~~~~ ~~~~~~~~~~
1 INTRODUCTION
he processors interconnection network (IN) is the
heart of the no remote memory access parallel com-
puters in which the inter-processors communications
are realized by exchanging messages over the processors
interconnection links. The performance of such com-
puters depends greatly on the performance of their proc-
essors IN. Among others performance criteria, the scal-
ability of an IN for massive parallelism, its capability of
messages deadlock-free routing on shortest paths, its ca-
pability of simulating others IN and its management facil-
ity are essential. In the research for IN which fulfill these
criteria, hyper-cubes constitute a very attractive alterna-
tive. Indeed, the incremental construction of hyper-cubes
confers to them interesting topological properties [1]
which allow them to meet most of these essential per-
formance criteria.
Consequently, on one side several commercial parallel
machines using them as IN have been built over the years
[2]. They have also been used as a means of interconnect-
ing and extending switching matrices in ATM cross con-
nects [3] or proposed as a model for new ATM switches
with low complexity and high performance [4]. Nowa-
days, they continue to be an attractive solution for multi-
core processor IN [5]. On the other side, several theoreti-
cal research works like the one in [6] have been done on
different aspects of their use as IN. Among these theoreti-
cal researches, one of the most challenging, since at least a
quarter of a century, is their rearrange ability under
queue less routing constraint, that is their capability to
route optimally any permutation such that each node
holds only one message throughout the routing.
Interconnection networks provide mechanisms for data
transfer among processing nodes or between processors
and memory modules. They are applied in parallel com-
puter systems, distributed computer systems, and espe-
cially networks on chip (NoC). A network is defined by
the topology and the protocol. The topology of networks
concerns the placement and interconnection of its nodes.
Protocols specify how these nodes and links work [7].
Topology is one of the most important design issues for
these networks [8]. Many topologies are orthogonal, and
nodes are arranged in an orthogonal n-dimension space.
The main advantages of orthogonal topologies are simple
routing, support for wide application spectrum, and fault
tolerance. One of the most widely used is hypercube
which has been applied in the interconnection network in
a wide variety of parallel systems such as Intel iPSC [9],
the Ncube [10], the Connection Machine CM-2 [11] and
SGI Origin 2000 [12].
The n-dimensional hypercube, however, scales too rap-
idly as n increases. The number of links, n2n-1, grows
more drastically than the number of processors, 2n [13].
To exacerbate the situation, link complexity is directly
related to hardware costs and affects VLSI implementa-
tion [14] [15]. Currently, practical number of links is lim-
ited to about eight per node [12]. When the size of a net-
work has been increases, added nodes must be 2i times
more than its nodes, which affects scalable characteristic.
Several variations of the hypercube have been in the li-
terature. Some variations focused on reduction of the hy-
percube diameter, for example the folded hypercube[16]
and crossed cube [17]; some focused on reduction of the
number of links of the hypercube, for example cube con-
nected cycles [18], reduced hypercube[19], and exchanged
T
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 6, JUNE 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 163
hypercube [15]; and some focused on both, as in the hier-
archical cubic network [20]. Reducing link complexity,
however, typically compromises performance, applica-
tion support and reliability. The challenge then is to
achieve a good balance of affordable computational per-
formance and support for larger scale problems [21]. In
hypercube structure, the node encoding based on Gray
Code has one key property which is there exists a link
between two nodes only if their binary addresses differ
in a single bit. This property is useful for deriving a num-
ber of parallel algorithms for the hypercube architecture
and can simplify routing protocol implementation [22].
2 FOLDED HYPERCUBE STRUCTURE
Design of interconnection networks is an important inte-
gral part of parallel processing and distributed systems.
There are a large number of topological choices for inter-
connection networks (the interested readers may refer to
[23-25] for extensive references). Among them, the hyper-
cube [26] has several excellent properties such as recur-
sive structure, regularity, symmetry, small diameter, rela-
tively short mean inter node distance, low degree, and
very small link complexity, which are very important for
designing massively parallel or distributed systems [27].
Since its introduction, many variants of the hypercube
have been proposed [28-34].
One variant that has been the focus of a great deal of re-
search is the folded hypercube, which is an extension of
the hypercube, constructed by adding a link to every pair
of nodes that are the farthest apart, i.e., two nodes with
complementary addresses. The folded hypercube has
leen shovn lo le alIe lo inpiove lhe syslens peifoim-
ance over a regular hypercube in many measurements
[28,31].
G = (V, E) is a graph if V is a finite set and E is a subset of
{(u, v)|(u, v) is an unordered pair of V}. We say that V is
the node set and E is the edge set. We also use V(G) and
E(G) to denote the node set and edge set of G, respec-
tively. In this paper, we use graph and network, node and
vertex, link and edge, interchangeably. Usually when the
Hamiltonicity of a graph G is concerned, it is investigated
whether G is Hamiltonian or Hamiltonian-connected. A
cycle (resp., path) in G is called a Hamiltonian cycle
(resp., Hamiltonian path) if it contains every node of G
exactly once. G is said to be Hamiltonian if it contains a
Hamiltonian cycle, and Hamiltonian-connected if there
exists a Hamiltonian path between every two nodes of G.
An n-dimensional folded hypercube, denoted by FQn,
is an enhanced n-dimensional hypercube with one extra
link between nodes that have the furthest Hamming dis-
tance. With the hardware overhead being 1/n, FQn offers
proportional or substantial improvement over the stan-
dard hypercube of the same dimensionality in terms of
communication parameters, such as average distance,
message traffic density, communication bandwidth, and
communication time delay, etc [28], [32]. To serve as a
basis of communication including one-to-all/all-to-all
broadcasting and one-to-all/all-to-all personalized com-
munication, Ho [32] suggested a construction of multiple
spanning trees in FQn to utilize for the broadcasting
scheme or communication protocol.
Two spanning trees are said to be edge-disjoint if they
are rooted at the same node without sharing any common
edge. A result showed that all n + 1 spanning trees in FQn
constructed in [32] are edge-disjoint. There are still some
constructions of a set of pairwise edge-disjoint spanning
trees in a particular family of interconnection networks
[33-38].
2.1 n-dimensional hypercube
The well-known n-dimensional hypercube is a graph Qn
=(V,E) with |V| =2
n
and |E| = n2
(n-1)
. Each vertex can be
represented by an n-bit binary string. There is a link be-
tween two vertices whenever their binary string represen-
tation differ in only one bit position. As a variant of the
hypercube, the n-dimensional folded hyper-cube FQn,
proposed first by El-Amawy and Latifi [28], is a graph
obtained from the hypercube Qn by adding 2
(n-1)
edges,
called complementary edges, each of them is between
vertices.
An n-dimensional hypercube, denoted by Qn, is a
graph consisting of N = 2
n
vertices represented by binary
strings of length n from 0 to 2
n
1. Two vertices in Qn are
adjacent if and only if their corresponding binary strings
differ in exactly one bit. An n-dimensional folded hyper-
cube, denoted by FQn, is basically a Qn enhanced with
extra links between any two nodes whose binary strings
are complements of each other. Figure 1 shows the graph
FQ4, where dotted lines represent complement links. El-
Amawy and Latih [28] showed that FQn is (n + 1)-regular
(n + 1)-connected and has diameter n/2. Ma and Xu
[39] proved that FQn is node-symmetric and edge-
symmetric. For more results related to folded hypercubes,
the reader can refer to [40-44]
3 N-DIMENSIONAL FOLDED HYPERCUBE(FOLDED N-
CUBE)
A n-dimensional folded hypercube (folded n-cube for
short) F Qn is a regular n-dimensional hypercube aug-
mented by adding more links among its nodes. More spe-
cifically, a folded n-cube is obtained by adding a link be-
tween two nodes whose addresses are complementary to
each other; i.e., for a node whose address is b= b1b2...bn, it
Fig.1. A 4-dimensional folded hypercube FQ4.
now has one more link to node c= c1c2...cn, in addition to
its original n links. So a folded n-cube has 2
(n1)
more links
than a regular n-cube. We call these augmented links
skips, to distinguish them from regular links, and use S to
denote the set of skips. So the complete link set E(F Qn) of
a folded hypercube can be expressed as I S.
In other words, we can formally define the edges of a
folded n-cube by E(FQn) = I S = {e = (u, v)|h(u, v) = 1
I or h(u, v) = n S}.
The n-dimensional folded hypercube FQn is Hamilto-
nian-connected, when n = 1 or n (> 2) is even.
3.1 FQ3: three-dimensional folded hypercube
(folded 3-cube )
Three-dimensional folded hypercube and hypercube are
shown in Fig. 2.
Fig. 3 illustrates a two-dimensional and a three-
dimensional folded hypercube.
3.2 Four-dimensional folded hypercube (folded 4-
cube)
Fig. 4 illustrates a three-dimensional and a four-
dimensional folded hypercube.
4 SIMULATIONDETAILS
A network simulator is used to evaluate the concept for a
typical communications scenario that must support sev-
eral classes of traffic having a range of QoS requirements.
We would use the tool, Network Simulator ns-2 [45],[46]
which has been extensively used in the research for de-
sign and evaluation of public domain computer network,
to evaluate various design options for NOC architecture,
including the design of router, communication protocol,
Routing algorithms. NS-2 is an open source, object-
oriented and discrete event driven network simulator
written in C++ and OTcl. It is a very common and widely
used tool to simulate small and large area networks [47].
In this study, we have modeled our NoC architecture
concepts with the widely used network simulator ns-2
[48]. This tool has been widely applied in research related
to the design and evaluation of computer networks and to
evaluate various design options for NoC architectures
[49], including the design of routers, communication pro-
tocols, etc.
5 SIMULATIONRESULTS
In this section, we present the Simulation of NOC- Folded
Heawood and we survey the ability and flexibility of ns2
in NOC simulations. Mapping an application, which is
described by a parameterized task graph, on to NoC is a
Fig.2. The figure of FQ3 and Q3
Fig.3. The folded 2-cube and a folded 3-cube.
Fig.4. The folded hypercubes FQ3 and FQ4, where the heavy edges
are complementary edges.
key research problem in NoC design. Mesh topology has
been used in a variety of interconnection network appli-
cations especially for NoC design. However, the Folded
Heawood has not been studied yet as the underlying to-
pology for NoCs.
Figures 5 to 8 show different views of the 3d- Folded
Heawood.
5.1 The 3d-FolH-Network simulation
Figures 5 to 7, show different views of the 3d-Folded Heawood
Network simulation.
5.2 Folded Heawood Network-on-chip simulation
Figures 7 to 8, show different views of the FQ3-NOC simulation:
Fig.5. 1st view of simulation the FQ3-Network.
Fig.6. 2nd view of simulation the FQ3-Network.
Fig.7. 1st view of simulation the 3d-FolH-NOC.
Fig.8. The 2nd view of simulation the 3d-FolH-NOC.
REFERENCES
[1] Y. Saad and M. H. Schultz, "Topological properties of
hypercubes", IEEE Trans. Comput., C-37, 1988, pp.
867-872. http://dx.doi.org/10.1109/12.2234 Y. Liu, J.
Han and H. Du., "A Hypercube-based Scalable Inter-
connection Network for Massively Parallel Comput-
ing", Journal of Computers, 3(10) 2008, pp. 58-65.
http://dx.doi.org/10.4304/jcp.3.10.58-65
[2] D.C.W. Pao and W.N. Chau, "Design of ATM switch
using hypercube with distributed shared input buff-
ers and dedicated output buffers", in Proc. of Interna-
tional Conference on Network Protocols, Tokyo, 7-10
Nov. 1995, pp. 92-99,
http://dx.doi.org/10.1109/ICNP.1995.
[3] J. S. Park and N. J. Davis, "The Folded Hypercube
ATM Switches", in Proc. of IEEE International Con-
ference on Networking, July 2001, Part II, July 2001,
pp. 370-379, http://dx.doi.org/10.1007/3-540-
47734-9_37.
[4] Chang Wu, Yubai Li , Qicong Peng, Song Chai and
Zhongming Yang, "Construction of a multidimen-
sional plane network-on-chip architecture based on
the hypercube structure", Progress in Natural Sci-
ence, Volume 19, Issue 5, 10 May 2009, pp. 635-641,
http://dx.doi.org/10.1016/j.pnsc.2008.10.003.
[5] N. Gopalakrishna Kini, M. Sathish Kumar, H.S. Mru-
thyunjaya, "Analysis and Comparison of Torus Em-
bedded Hypercube Scalable Interconnection Network
for Parallel Architecture", IJCSNS International Jour-
nal of Computer Science and Network Security, 9(1),
January 2009, pp 242-247.
[6] A. K. Laing and D. W. Krumme, "Optimal Permuta-
tion Routing for Low-dimensional Hypercubes",
Networks 55, 2010, pp. 149-167,
http://dx.doi.org/10.1002/net.20325.
[7] W. DaIIy and . TovIes, Roule packels, nol viies:
on-chip inleiconneclion nelvoiks, InIioc. lhe De-
sign Automation Conference, Las Vegas, NV, pp. 684-
689,2001.
[8] R.L. Shaina, Nelvoik TopoIogy Oplinizalion: The
Art and Science of Nelvoik Design, Van Nosliand
Reinhold, 1990.
[9] Vanvooisl, ., SeideI, S. & aiscz, L, WoikIoad of an
ipsc/860, In Proceedings of the Scalable High Per-
formance Computing Conference, pp 221228, 1994.
[10] Hayes, }. I. & Mudge, T. N, Hypeicule Supei com-
puters. PROC. IEEE 7(12) 18291841,1989.
[11] Tuckei, L. W. & Roleilson, C. C., Aichilecluie and
appIicalions of lhe conneclion nachine, ILLL Com-
puter 21,pp 2638.1988.
[12] SGI (1998), performance tuning optimization forOri-
gin2000 and Onyx2,http://tec
hpubs.sgi.com/Library
/manuals/3000/0351101/html/O2000Tuning
[13] Duato, J., Yalamanchili, S., Ni, L.: Interconnection
Networks: an Engineering Approach. Publishing
House of Electronics Industry, Beijing 2004.
[14] W.}. Hsu, Iilonacci Cules-A New Interconnection
TopoIogy,ILLE Trans. Parallel and Distributed Sys-
tems, vol. 4, no. 1, pp. 3-12,Jan. 1993.
[15] Ielei K.K. Loh, Wen }ing Hsu, Yi Ian, The Lx-
changed Hypeicule, ILLL TRANS. IaiaIIeI and Dis-
tributed Systems, VOL. 16, NO. 9, 2005.
[16] Anavy,.& Lalifi., Iiopeilies and peifoinance of
foIded hypeicules , ILLL Tians. on IaiaIIeI and
Distributed Systems 2, pp.3142,1999.
[17] Lfe, K., The ciossed cule aichilecluie foi paiaIIeI
conpulalion, ILLL Tians. IaiaIIeI and Disliiluled
Systems 3(5),pp. 513524.1992.
[18] Preparata,F. P. & VuiIIenin, }., The cule-connected
cycIes: a veisaliIe nelvoik foi paiaIIeI conpulalion,
Communications of the ACM 24,pp. 300309.1981.
[19] Ziavias, S. C, RH: a veisaliIe faniIy of ieduced hy-
peicule inleiconneclion nelvoiks, ILLL Tians. Iar-
allel and Distributed Systems 5 (11),1994.
[20] Sang Kyun Yun , Connenls on HieiaichicaI culic
nelvoiks ILLL Tians. IaiaIIeI and Disliiluled sys-
tems 9(4),pp. 10-414. 1998.
[21] }. Xu, A. Kunai, and X. Yu, On lhe IundanenlaI
Tradeoffs between Routing Table Size and Network
Diameter in P2P Networks, IEEE J. Selected Areas in
Comm., vol. 22, no. 1,pp. 151-163, Jan. 2004.
[22] M.Venkata Rao1, Dr.N. Chalamaiah, Hypercube and
Ils Vaiianl Nelvoiks: A TopoIogicaI LvaIualion,
Proceedings of the Eighth International Conference
on High-Performance Computing in Asia-Pacific Re-
gion (HPCASIA2005).
[23] J.C. Bermond (Ed.), Interconnection networks, Dis-
crete Applied Mathematics 37-38 (1992) (special is-
sue).
[24] D.F. Hsu, Interconnection networks and algorithms,
Networks 23 (4) (1993) (special issue).
[25] J. Xu, Topological Structure and Analysis of Inter-
connection Networks, Kluwer Academic Publishers,
2001.
[26] L. Bhuyan, D.P. Agrawal, Generalised hypercubes
and hyperbus structure for a computer network, IEEE
Transactions on Computers 33 (1984) 323-333.
[27] F.T. Leighton, Introduction to Parallel Algorithms
and Architecture: Arrays, Trees, Hypercubes, Morgan
Kaufmann, San Mateo, CA, 1992.
[28] A. El-Amawy, Shahram Latifi, Properties and per-
formance of folded hypercubes, IEEE Transactions on
Parallel and Distributed Systems 2(1) (1991) 31-42.
[29] A.H. Esfahanian, L.M. Ni, B.E. Sagan, The twisted n-
cube with application to multiprocessing, IEEE
Transactions on Computers 40 (1991) 88.
[30] F.P. Preparata, J. Vuillemin, The cube-connected cy-
cles: A versatile network for parallel computation,
Communication of the ACM 24 (1981) 300-309.
[31] D. Wang, Embedding Hamiltonian cycles into folded
hypercubes with faulty links, Journal of Parallel and
Distributed Computing 61 (4) (2001) 545-564.
[32] C.-T. Ho, Full bandwidth communications on folded
hypercubes, in Proc. 1990 International conference on
Parallel Processing, vol. 1, Penn State, 1990, pp. 267-
280.
[33] Y.-S. Chen, T.-Y. Juang, and Y.-Y. Shen, Congestion-
free embedding of 2(nk) spanning liees in an ar-
rangement graph, Journal of System Architecture 47
(2001) 73-86.
[34] P. Fraigniaud and C.-T. Ho, Arc-disjoint spanning
trees on the cube-connected-cycles network, in: Proc.
of the International Conference on Parallel Process-
ing, vol. 1, 1991, pp. 225-229.
[35] P. Fragopoulou, Edge-disjoint spanning trees on the
star network with applications to fault tolerance,
IEEE Transactions on Computers 45 (1996) 174-185.
[36] S.-Y. Hsieh and C.-J. Tu, Constructing edge-disjoint
spanning trees in locally twisted cubes, Theoretical
Computer Science 410 (2009) 926-932
[37] S.L. Johnson and C.-T. Ho, Optimum broadcasting
and personalized communication in hypercubes,
[38] C.-T. Lin, Embedding k(n k) edge-disjoint spanning
trees in arrangement graphs, Journal of Parallel and
Distributed Computing 63 (2003) 1277-1287.
[39] M.-J. Ma and J.-M. Xu, Algebraic properties and pan-
connectivity of folded hypercubes, Ars Combinatoria,
to appear.
[40] X.-B. Chen, Some results on topological properties of
folded hypercubes, Information Processing Letters
109 (2009) 395-399.
[41] J.-F. Fang, The bipanconnectivity and m-
panconnectivity of the folded hypercube, Theoretical
Computer Science 385 (2007)286-300.
[42] C.-N. Lai, G.-H. Chen, and D.-R. Duh, Constructing
one-to-many disjoint paths in folded hypercubes,
[43] Q. Zhu, J.-M. Xu, X. Hou, M. Xu, On reliability of the
folded hypercubes, Information Sciences 177 (2007)
1782-1788.
[44] Q. Zhu, S.-Y. Liu, M. Xu, On conditional diagnosabil-
ity of the folded hypercubes, Information Sciences
178 (2008) 1069-1077.
[45] LBNL Network Simulator, http://www-
nrg.ee.lbl.gov/ns/
[46] The network simulator - ns-2, available at
http://www.isi.edu/nsnam/ns/
[47] M. Ali, M. Welzl, A. Adnan, F. Nadeem , " Using the
NS-2 Network Simulator for Evaluating Network on
Chips (NoC)".
[48] www.isi.edu/nsnam/ns
[49] R. Lemaire, F. Clermidy, Y. Durand, D. Lattard, and
A. }eiiaya, Ieifoinance LvaIualion of a NoC-Based
Design for MC-CDMA Telecommunications Using
NS-2, in The 16th IEEE International Workshop on
Rapid System Prototyping, Jun. 2005, pp. 24-30.

3D-FolH-NOC: A New Structure For Parallel Processing and Distributed Systems

Diunggah oleh

Informasi Dokumen

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

3D-FolH-NOC: A New Structure For Parallel Processing and Distributed Systems

Diunggah oleh

Hak Cipta:

Format Tersedia

3D-FolH-NOC: A New structure for parallel processing and

Anda mungkin juga menyukai