![Page 1: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/1.jpg)
EE 382C - S11 - Lecture 13 1
EE382C
Lecture 13
Network Performance Analysis
5/12/11
![Page 2: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/2.jpg)
EE 382C - S11 - Lecture 13 2
Announcements
• I will be out all next week (IPDPS in Alaska)
– No office hours
– George doing both lectures
• Project sign-up (May 24th and 26th)
– 15 min. presentation + 3 min. for questions
• Final report due (May 31st -- 5pm)
![Page 3: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/3.jpg)
EE 382C - S11 - Lecture 13 3
So far
• Topology
• Routing
• Flow Control / Deadlock
• Microarchitecture – datapath/control
![Page 4: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/4.jpg)
EE 382C - S11 - Lecture 13 4
Question of the day
What is the best way to evaluate an interconnection network?
a) analysis
b) simulation
c) experiment
![Page 5: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/5.jpg)
EE 382C - S11 - Lecture 13 5
Question of the day II
What metrics should you be worried about when evaluating an
interconnection network?
![Page 6: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/6.jpg)
EE 382C - S11 - Lecture 13 6
Network Performance
• Latency
• Throughput
• Steady state
• Open loop
![Page 7: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/7.jpg)
EE 382C - S11 - Lecture 13 7
T
Applied Load-Latency
![Page 8: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/8.jpg)
EE 382C - S11 - Lecture 13 8
Offered vs. Accepted
![Page 9: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/9.jpg)
EE 382C - S11 - Lecture 13 9
Network StabilityThroughput at maximum load vs peak throughput
![Page 10: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/10.jpg)
EE 382C - S11 - Lecture 13 10
BNF chart
(Why is this wrong?)
![Page 11: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/11.jpg)
How can you design a stable network?
EE 382C - S11 - Lecture 13 11
![Page 12: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/12.jpg)
Throughput vs Offered Traffic for Stable Network8x8 Mesh, DOR, Bit Complement
EE 382C - S11 - Lecture 13 12
![Page 13: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/13.jpg)
EE 382C - S11 - Lecture 13 13
Simple network
0 1
1
0.1
01
10
![Page 14: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/14.jpg)
EE 382C - S11 - Lecture 13 14
Simple network
0 1
1
0.1
01
10
At what load does the simple network saturate?
![Page 15: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/15.jpg)
Measure the minimum throughput over
source-destination pairs, not the average
EE 382C - S11 - Lecture 13 15
0.10 1
1 0
0.9
0 0
1 0
![Page 16: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/16.jpg)
EE 382C - S11 - Lecture 13 16
3 ways to measure performance
• Analysis
• Simulation
• Experiment
![Page 17: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/17.jpg)
EE 382C - S11 - Lecture 13 17
Analysis
Example – switch speedup analysis
![Page 18: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/18.jpg)
• Probability that an input requests a particular output
• Probability that an input doesn’t request a particular output
EE 382C - S11 - Lecture 13 18
Pi 1
k
PNi k 1
k
![Page 19: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/19.jpg)
• Probability that no input requests a particular output
• Probability that some input requests a particular output
EE 382C - S11 - Lecture 13 19
PNa k 1
k
k
Pa 1k 1
k
k
![Page 20: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/20.jpg)
• Pa is the throughput of a switch with unit speedup.
• If we add input speedup this number goes up – but is still
bounded by 1
EE 382C - S11 - Lecture 13 20
Pa 1k 1
k
si k
![Page 21: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/21.jpg)
• Adding output speedup increases overall throughput by so
and makes input speedup effectively si/so
EE 382C - S11 - Lecture 13 21
Pa so 1k 1
k
si
so
k
![Page 22: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/22.jpg)
EE 382C - S11 - Lecture 13 22
Analysis
Example – queuing theory
![Page 23: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/23.jpg)
EE 382C - S11 - Lecture 13 23
Network to Analyze
0
1
2
3
Switch
00
Switch
01
Switch
10
Switch
11
0
1
2
3
![Page 24: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/24.jpg)
EE 382C - S11 - Lecture 13 24
Model
T
0
T1
T2 T
T0
T1
T
0
T1
T0
T1
T2 T
T2 T
T2 T
Switch 00
![Page 25: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/25.jpg)
EE 382C - S11 - Lecture 13 25
Result
![Page 26: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/26.jpg)
EE 382C - S11 - Lecture 13 26
Folded Clos network example
0
5
10
15
20
25
30
35
40
0 0.2 0.4 0.6 0.8 1
Offered load
La
ten
cy
(c
yc
les
)
oblivious - folded Clos oblivious - Clos M/D/1 model
![Page 27: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/27.jpg)
EE 382C - S11 - Lecture 13 27
Simulation Workload
• Application-Driven
• Trace-Driven
• Synthetic workload
– Traffic pattern
– Injection Process
![Page 28: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/28.jpg)
EE 382C - S11 - Lecture 13 28
Injection process
time
Inje
ction
pro
cess
T = 1/r
time
Inje
ction
pro
cess
E[T] = 1/r
![Page 29: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/29.jpg)
Simulation Setup
EE 382C - S11 - Lecture 13 29
![Page 30: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/30.jpg)
Simulation Procedure
• Warm up the simulator with “no measurement” packets
– Make sure you are in steady-state before taking a steady state
measurement
• Once in steady state, inject “measurement packets” long
enough to get a statistically meaningful measurement
– Apply the usual tests and compute error bounds
• Drain the simulator while injecting “no measurement”
packets until all “measurement packets” arrive at their
destinations.
EE 382C - S11 - Lecture 13 30
![Page 31: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/31.jpg)
Include an infinite Source Queue when
measuring Latency Do not do the following:
EE 382C - S11 - Lecture 13 31
![Page 32: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/32.jpg)
EE 382C - S11 - Lecture 13 32
Simulation results – Virtual channels
![Page 33: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/33.jpg)
EE 382C - S11 - Lecture 13 33
Packet sizes
![Page 34: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/34.jpg)
EE 382C - S11 - Lecture 13 34
Age based priority
![Page 35: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/35.jpg)
EE 382C - S11 - Lecture 13 35
Question of the day
What is the best way to evaluate an interconnection network?
a) analysis
b) simulation
c) experiment
![Page 36: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/36.jpg)
EE 382C - S11 - Lecture 13 36
Question of the day II
What metrics should you be worried about when evaluating an
interconnection network?
![Page 37: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/37.jpg)
Errors to Avoid
• Don’t forget the source queue
• Measure minimum traffic across pairs
• Don’t combine latency with accepted traffic
• Measure all “measurement packets” generated during test
interval
– May require a long draining period
• Use realistic traffic – not just UR
EE 382C - S11 - Lecture 13 37
![Page 38: EE382C Lecture 13 - cva.stanford.educva.stanford.edu/classes/ee382c/lectures/L13.pdf · EE 382C - S11 - Lecture 13 2 Announcements • I will be out all next week (IPDPS in Alaska)](https://reader034.vdocuments.net/reader034/viewer/2022042310/5ed81034cba89e334c672d18/html5/thumbnails/38.jpg)
EE 382C - S11 - Lecture 13 38
Summary of performance analysis
• Analysis, simulation, experiment
– Maximize insight / effort
• Measurements – steady state, open loop, on specified
– Warm up, source queue, min throughput
• Queueing theory
– M/M/1 N = r1r
• Simulation
– Workloads
– Errors – systematic and sampling
– Confidence intervals and ensemble averages