STATIC INTERCONNECTION NETWORKS
Transcript of STATIC INTERCONNECTION NETWORKS
STATIC
INTERCONNECTION NETWORKS
Mariam A. Salih
STATIC INTERCONNECTION NETWORKS
Properties of interconnection networks
Completely Connected Networks
Limited Connection Networks linear arrays;
ring (loop) networks;
two-dimensional arrays (nearest-neighbor mesh);
tree networks; and
hypercube networks.
STATIC INTERCONNECTION NETWORKS
Static (fixed) interconnection networks
are characterized by having fixed paths,
unidirectional or bidirectional, between
processors.
Two types of static networks can be
identified. These are:
completely connected networks (CCNs)
limited connection networks (LCNs).
Properties of interconnection
networks:
Completely Connected Networks
In a completely connected network (CCN) each node is
connected to all other nodes in the network.
Completely connected networks guarantee fast delivery
of messages from any source node to any destination
node (only one link has to be traversed).
Notice also that since every node is connected to every
other node in the network, routing of messages between
nodes becomes a straightforward task.
Completely connected networks are, however, expensive
in terms of the number of links needed for their
construction.
Limited Connection Networks
Limited connection networks (LCNs) do not
provide a direct link from every node to every
other node in the network.
communications between some nodes have to
be routed through other nodes in the network.
Two important conditions for LCN:
1. the need for a pattern of interconnection among
nodes.
2. the need for a mechanism for routing messages around the network until they reach their destinations.
A number of regular interconnection patterns
have evolved over the years for LCNs these
patterns include: linear arrays;
ring (loop) networks;
two-dimensional arrays (nearest-neighbor mesh);
tree networks; and
hypercube networks.
linear array and ring network
In a linear array, each node is connected
to its two immediate neighboring nodes.
If the two nodes at the extreme ends of a
linear array network are connected, then
the resultant network has ring (loop)
architecture.
linear arrays are simple in their architecture
and have simple routing mechanisms, they
tend to be slow.
linear array and ring
Binary tree network In a tree network, of which the binary tree is a
special case,
Static
dynamic
N- hypercube Networks
in a hypercube, there is an edge between a given pair of nodes if and only if the binary representation of their addresses differs by one and only one bit.
Example of 4-bit hypercube
Mesh-Connected Networks
can be defined as an interconnection
structure of two dimensions Grid
Torus
Mesh architecture
with wrap around
connections forms a
torus.
Torus is combination
grid and circular.
Simple Quiz..