1.13 Exercises 12-15
?
?

Keyboard Navigation

Global Keys

[, < / ], > Jump to previous / next episode
W, K, P / S, J, N Jump to previous / next marker
t / T Toggle theatre / SUPERtheatre mode
V Revert filter to original state Y Select link (requires manual Ctrl-c)

Menu toggling

q Quotes r References f Filter y Link c Credits

In-Menu Movement

a
w
s
d
h j k l


Quotes and References Menus

Enter Jump to timecode

Quotes, References and Credits Menus

o Open URL (in new tab)

Filter Menu

x, Space Toggle category and focus next
X, ShiftSpace Toggle category and focus previous
v Invert topics / media as per focus

Filter and Link Menus

z Toggle filter / linking mode

Credits Menu

Enter Open URL (in new tab)
0:06Recap and set the stage for the day
0:06Recap and set the stage for the day
0:06Recap and set the stage for the day
1:34Chapter 1.13, Exercise 1.12 - The pitfall of utilizing a subset of the performance equations1
1:34Chapter 1.13, Exercise 1.12 - The pitfall of utilizing a subset of the performance equations1
1:34Chapter 1.13, Exercise 1.12 - The pitfall of utilizing a subset of the performance equations1
4:01Chapter 1.13, Exercise 1.12.1 - Fallaciously equating clock rate with performance
4:01Chapter 1.13, Exercise 1.12.1 - Fallaciously equating clock rate with performance
4:01Chapter 1.13, Exercise 1.12.1 - Fallaciously equating clock rate with performance
6:45A few words on pcalc, Unix sockets and TCP
6:45A few words on pcalc, Unix sockets and TCP
6:45A few words on pcalc, Unix sockets and TCP
7:13Chapter 1.13, Exercise 1.12.1 continued
7:13Chapter 1.13, Exercise 1.12.1 continued
7:13Chapter 1.13, Exercise 1.12.1 continued
17:04Chapter 1.13, Exercise 1.12.2 Fallaciously equating instruction count to CPU time
17:04Chapter 1.13, Exercise 1.12.2 Fallaciously equating instruction count to CPU time
17:04Chapter 1.13, Exercise 1.12.2 Fallaciously equating instruction count to CPU time
27:39A few thoughts on processor marketing and performance benchmarks
27:39A few thoughts on processor marketing and performance benchmarks
27:39A few thoughts on processor marketing and performance benchmarks
35:37Chapter 1.13, Exercise 1.12.3 Fallaciously using MIPS to compare two different processors
🖌
35:37Chapter 1.13, Exercise 1.12.3 Fallaciously using MIPS to compare two different processors
🖌
35:37Chapter 1.13, Exercise 1.12.3 Fallaciously using MIPS to compare two different processors
🖌
45:40Chapter 1.13, Exercise 1.12.4 Fallaciously using MFLOPS to compare two different processors2
🖌
45:40Chapter 1.13, Exercise 1.12.4 Fallaciously using MFLOPS to compare two different processors2
🖌
45:40Chapter 1.13, Exercise 1.12.4 Fallaciously using MFLOPS to compare two different processors2
🖌
1:02:32Chapter 1.13, Exercise 1.13 - The pitfall of expecting to improve the overall performance of a computer by improving only one aspect of it3
1:02:32Chapter 1.13, Exercise 1.13 - The pitfall of expecting to improve the overall performance of a computer by improving only one aspect of it3
1:02:32Chapter 1.13, Exercise 1.13 - The pitfall of expecting to improve the overall performance of a computer by improving only one aspect of it3
1:04:20Chapter 1.13, Exercise 1.13 - The metrics under consideration
🖌
1:04:20Chapter 1.13, Exercise 1.13 - The metrics under consideration
🖌
1:04:20Chapter 1.13, Exercise 1.13 - The metrics under consideration
🖌
1:10:34A few thoughts on homework questions
💢
1:10:34A few thoughts on homework questions
💢
1:10:34A few thoughts on homework questions
💢
1:17:13Amdahl's Law
🖌
1:17:13Amdahl's Law
🖌
1:17:13Amdahl's Law
🖌
1:22:08Chapter 1.13, Exercise 1.13.1 - Calculating the total time reduction for a 20% reduction in time for floating point operations
🖌
1:22:08Chapter 1.13, Exercise 1.13.1 - Calculating the total time reduction for a 20% reduction in time for floating point operations
🖌
1:22:08Chapter 1.13, Exercise 1.13.1 - Calculating the total time reduction for a 20% reduction in time for floating point operations
🖌
1:31:08croepha Hello
🗪
1:31:08croepha Hello
🗪
1:31:08croepha Hello
🗪
1:31:19Chapter 1.10 - Fallacies and Pitfalls, reviewing Amdahl's Law4
1:31:19Chapter 1.10 - Fallacies and Pitfalls, reviewing Amdahl's Law4
1:31:19Chapter 1.10 - Fallacies and Pitfalls, reviewing Amdahl's Law4
1:34:47Chapter 1.13, Exercise 1.13.1 continued
🖌
1:34:47Chapter 1.13, Exercise 1.13.1 continued
🖌
1:34:47Chapter 1.13, Exercise 1.13.1 continued
🖌
1:37:02Amdahl's Law5
1:37:02Amdahl's Law5
1:37:02Amdahl's Law5
1:45:06Chapter 1.13, Exercise 1.13.1 continued
🖌
1:45:06Chapter 1.13, Exercise 1.13.1 continued
🖌
1:45:06Chapter 1.13, Exercise 1.13.1 continued
🖌
1:58:00Relating our intuitive equation for Amdahl's Law back to that given in the book6
🖌
1:58:00Relating our intuitive equation for Amdahl's Law back to that given in the book6
🖌
1:58:00Relating our intuitive equation for Amdahl's Law back to that given in the book6
🖌
2:18:06Work through the algebra for Amdahl's Law
🖌
2:18:06Work through the algebra for Amdahl's Law
🖌
2:18:06Work through the algebra for Amdahl's Law
🖌
2:30:30Request for help clarifying Amdahl's Law7
2:30:30Request for help clarifying Amdahl's Law7
2:30:30Request for help clarifying Amdahl's Law7
2:31:36Chapter 1.13, Exercise 1.13.1 concluded
🖌
2:31:36Chapter 1.13, Exercise 1.13.1 concluded
🖌
2:31:36Chapter 1.13, Exercise 1.13.1 concluded
🖌
2:32:17Chapter 1.13, Exercise 1.13.2 - Calculating the time reduction for integer operations given a total time reduction of 20%
🖌
2:32:17Chapter 1.13, Exercise 1.13.2 - Calculating the time reduction for integer operations given a total time reduction of 20%
🖌
2:32:17Chapter 1.13, Exercise 1.13.2 - Calculating the time reduction for integer operations given a total time reduction of 20%
🖌
2:35:26Consult the Errata8
2:35:26Consult the Errata8
2:35:26Consult the Errata8
2:39:43Chapter 1.13, Exercise 1.13.2 continued
🖌
2:39:43Chapter 1.13, Exercise 1.13.2 continued
🖌
2:39:43Chapter 1.13, Exercise 1.13.2 continued
🖌
2:44:10Chapter 1.13, Exercise 1.13.3 - Trying to reduce the total time by 20% by reducing only the time for branch instructions
🖌
2:44:10Chapter 1.13, Exercise 1.13.3 - Trying to reduce the total time by 20% by reducing only the time for branch instructions
🖌
2:44:10Chapter 1.13, Exercise 1.13.3 - Trying to reduce the total time by 20% by reducing only the time for branch instructions
🖌
2:45:34Chapter 1.13, Exercise 1.14 - Improving the execution time of a given program9
2:45:34Chapter 1.13, Exercise 1.14 - Improving the execution time of a given program9
2:45:34Chapter 1.13, Exercise 1.14 - Improving the execution time of a given program9
2:47:10Chapter 1.13, Exercise 1.14 - The metrics under consideration
🖌
2:47:10Chapter 1.13, Exercise 1.14 - The metrics under consideration
🖌
2:47:10Chapter 1.13, Exercise 1.14 - The metrics under consideration
🖌
2:58:11Chapter 1.13, Exercise 1.14.1 - Improving the CPI of floating point instructions to make the program run two times faster
🖌
2:58:11Chapter 1.13, Exercise 1.14.1 - Improving the CPI of floating point instructions to make the program run two times faster
🖌
2:58:11Chapter 1.13, Exercise 1.14.1 - Improving the CPI of floating point instructions to make the program run two times faster
🖌
3:01:07Chapter 1.13, Exercise 1.14.2 - Improving the CPI of load / store instructions to make the program run two times faster
🖌
3:01:07Chapter 1.13, Exercise 1.14.2 - Improving the CPI of load / store instructions to make the program run two times faster
🖌
3:01:07Chapter 1.13, Exercise 1.14.2 - Improving the CPI of load / store instructions to make the program run two times faster
🖌
3:07:55Chapter 1.13, Exercise 1.14.3 - Calculating the execution time improvement given a reduced CPI of integer and floating point instructions by 40%, and load / store and branch instructions by 30%
🖌
3:07:55Chapter 1.13, Exercise 1.14.3 - Calculating the execution time improvement given a reduced CPI of integer and floating point instructions by 40%, and load / store and branch instructions by 30%
🖌
3:07:55Chapter 1.13, Exercise 1.14.3 - Calculating the execution time improvement given a reduced CPI of integer and floating point instructions by 40%, and load / store and branch instructions by 30%
🖌
3:16:50Chapter 1.13, Exercise 1.15 - Parallel processing10
3:16:50Chapter 1.13, Exercise 1.15 - Parallel processing10
3:16:50Chapter 1.13, Exercise 1.15 - Parallel processing10
3:18:09Break
3:18:09Break
3:18:09Break
3:25:59Return with nourishment
3:25:59Return with nourishment
3:25:59Return with nourishment
3:27:38Chapter 1.13, Exercise 1.15 - Computing performance metrics for a program running on multiple parallel processors
🖌
3:27:38Chapter 1.13, Exercise 1.15 - Computing performance metrics for a program running on multiple parallel processors
🖌
3:27:38Chapter 1.13, Exercise 1.15 - Computing performance metrics for a program running on multiple parallel processors
🖌
3:50:37Reflect on our experience so far, and look forward to Chapter 2
3:50:37Reflect on our experience so far, and look forward to Chapter 2
3:50:37Reflect on our experience so far, and look forward to Chapter 2