1. Dynamic connection system
University of Technology
Computer engineering and information technology Department
Dynamic connection system
Can provide connection according need of application .
Have switch element (multiplexer).
Access to channel is switching , so can be use for communicate multi nodes.
For example:
Buses.
Multi stage network.
Cross multiplexer.

2. Basic properties of dynamic system
University of Technology
Computer engineering and information technology Department
Basic properties of dynamic system
Timing:
Synchronous (with clock).
Asynchronous (handshake, interlocking ).
switching:
Circuit (path is allocate for each transmission ), (low latency).
Packet (data are encapsulate into packet, transfer independency).
Control:
Centralization.
Distributed.

3. University of Technology
Computer engineering and information technology Department
Buses
Passive system connected to transfer data between communication nodes.
Buses using timing multiplex , transfer media is sharing .
In given time communication only two nodes(single bus).
Low cost, simple realization.
Low transmission, bad salability.
Weak (never ) stability toward fail. 3

4. University of Technology
Computer engineering and information technology Department
Single Bus system
The simplest way to connect multiprocessor, systems by Single bus system.

5. University of Technology
Computer engineering and information technology Department
Multi Bus system
A multiple bus multiprocessor system uses several parallel buses to interconnect multiple processors and multiple memory modules.

6. Multi stage linking network
University of Technology
Computer engineering and information technology Department
Multi stage linking network
MINs provide a number of simultaneous paths between the processors and the memory modules.
IN general MIN consists of a number of stages each consisting of a set of 2 × 2 switching elements.
Stages are connected to each other using Inter-stage Connection (ISC) Pattern.
These patterns may follow any of the routing In MINs

7. Multi stage linking network
University of Technology
Computer engineering and information technology Department
Multi stage linking network
General structure:
ISC1
ISC2
ISCn
a×b
a-1 a
2a-1
a^a-a
a^a-1
b-1 b
2b-1
b^b-b
b^b-1

8. Multi stage linking network
University of Technology
Computer engineering and information technology Department
Multi stage linking network
Switch model:
Have a input and b output.
In praxis used a=b=
where k= count control signal
Can make permutation.
Examples: Baseline, Omega. a0 a1 b0 b1
Straight
exchange
Upper _broadcast
lower _broadcast

9. Baseline model University of Technology
Computer engineering and information technology Department
Baseline model
M×M 1 2 3
M-2
M-1
M/2
M/2+1
M/2-2
M/2-1

10. University of Technology
Computer engineering and information technology Department
Omega connection
N processing element, an Omega network contains N/2 switches at each stage, and stages.
N/2 ( ) components.
Omega MIN requires log N clocks to make a connection

11. Cross switch connection
University of Technology
Computer engineering and information technology Department
Cross switch connection P0 P1 P2 M0 M1 M2 11

12. Cross switch connection
University of Technology
Computer engineering and information technology Department
Cross switch connection
Single Network with N² unary switch.
Switch element must solve conflict for request a bout current access.
Have possibility wire are complex and expensive.
Realization is only for small system.
Cross multiplexer provide better transmission properties.

13. Cross switch connection
University of Technology
Computer engineering and information technology Department
Cross switch connection
The crossbar can provide simultaneous connections among all its inputs and all its outputs.
components are needed to connect N × N pairs.
Major advantage it is need one clock to make connection between source and destination

14. Problem Hot-spot: Dead-lock: Live-Lock:
University of Technology
Computer engineering and information technology Department
Problem
Hot-spot:
Generated addresses are not equally distributed.
Multiple nodes want to communicate through small group switch.
Dead-lock:
Routing unknown “unknown where we have to send message”.
Or conflict on switch in network.
Live-Lock:
Continue routing unknown (still conflict).

15. Interconnection network abstract
University of Technology
Computer engineering and information technology Department
Interconnection network abstract