Beruflich Dokumente
Kultur Dokumente
sp2016
lec#7
Dr M Shamim Baig
1.1
Problems:
Explicit Parallel Architectures
1.2
Example Problem1:
Bus based SM-Multiprocessor
Limit of Parallelism
Consider a SM-Multiprocessor using
32-bit RISC processors running at 150
MHz, carries out one instruction per
clock cycle. Assume 15% data-load &
10% data-store instructions using
shared data Bus having 2GB/sec BW.
Compute Max number of processors
possible to connect on the above Bus
for following parallel configurations:1.3
Example Problems:
Bus based SM-Multiprocessor:
Limit of Parallelism.contd
(a) SMP (without cache memory)
(b) SMP with cache memory
having hit-ratio of 95% &
memory write-through policy
(c) NUMA with program Locality
factor = 80 %
1.4
Bus-based interconnects (a) with no local caches; (b) with local memory/caches.
Since much of the data accessed by processors is local to the processor, a
local memory can improve the performance of bus-based machines. Example??
1.5
1.6
Homework:
self assessed problems
Please mark your solution & note
the marks you achieved
???????
1.7
Example Problem2:
Message Passing Multicomputer,
Local vs Remote memory data access delays
Consider 64-node multicomputer, each node comprises of
32-bit RISC processor having 250 MHz clock rate & 8 MB
local memory. The Local memory access requires 4 clock
cycles, remote comm initiate (setup) overhead is 15 clock
cycles & the Interconnection Network BW is 80 MB/sec.
Total number of instructions executed are 200,000.
If memory data load & store are 15% & 10% respectively
of the instructions, compute:(a)Load/ store time if all accesses are to local nodes
(b)Load/ store time if 20% of accesses are to remote nodes
note: Assume Packet lengths are variable (depend on addr
& data bytes) & communication protocol given (SCP???).
(note: the size of message packet fields is in multiple of bytes)
1.8
Local
memory
Computers
1.9
1.10
1.11
1.12
Static vs Dynamic
Interconnection Networks (INs)
Static INs consist of point-to-point
communication links among
processing nodes and are also
referred to as direct networks.
Dynamic INs are built using switches
& communication links. Dynamic
networks are also referred to as
indirect networks.
1.13
Static vs Dynamic
Interconnection Networks (INs)
Static Interconnection
Networks (INs)
1.15
1.16
Completely Connected
Star
Tree
Linear Array & Ring
2-D/ 3-D Mesh & Torus
Hypercube
k-d Mesh
1.17
Static INs:
Evaluation Parameters
Degree : Max of links connected
at any node of the network
Diameter: Distance (shortest path)
between the farthest nodes in the
network.
Link Cost: Total Number of links
required to implement the network.
1.18
1.19
1.20
(b) Fat-tree IN
1.21
(b) Fat-tree IN
1.22