Lecture 13. Out of Order Execution II and Data Flow - CMU - Comp. Arch. 2015 - Onur Mutlu

  Рет қаралды 13,142

Carnegie Mellon Computer Architecture

Carnegie Mellon Computer Architecture

Күн бұрын

Пікірлер: 8
@guliyevshahriyar
@guliyevshahriyar 2 жыл бұрын
Onur Mutlu teacher, thank you very much!
@douggale5962
@douggale5962 3 жыл бұрын
The main load dependent upon store is when you pushed the return address to the stack, and you called something, that returned, now you are popping the return address from the stack. If that thing you called was really quick, you could be popping that return address before it even retired the store that pushed the return address. RSB covers that, but it has to check nonetheless. It has to do it for callee saved registers too, if it needed to save some and use them. It could be restoring them before the pushes for them retired.
@samzx81
@samzx81 8 жыл бұрын
The data flow stuff was really cool. Especially the idea of macro data flow. :)
@adeshshetty2830
@adeshshetty2830 7 жыл бұрын
Lecture starts at : kzbin.info/www/bejne/sGGonKGcj8mff9Um20s Data flow starts at: kzbin.info/www/bejne/sGGonKGcj8mff9Uh7m11s
@utkarshagarwal5391
@utkarshagarwal5391 7 жыл бұрын
who asked for it
@agsystems8220
@agsystems8220 Жыл бұрын
Are there any architectures that offload some of this memory difficulty onto the programmer/compiler? It seems like something where context can usually answer the question. For example, could you provide many different load/store instruction pairs, and have different policies for each? You could pretend that you have virtually partitioned the memory so that there is no way for some of these to hit the others, culling most of the dependencies at a software level. Some of the pairs could be extremely aggressive, taking an 'on your head be it' approach, and not even attempting to catch errors. This is absolutely fine for a load of immutable data, or a store that will next be read after some guaranteed pipeline clear such as a thread switch. Something like a stack access needs very different behaviour though, not least because cache misses are extremely unlikely. Why not simply tell the machine, or at least give it hints? It seems like a lot of area is being spent on working out what the programmer could just tell you.
@lagaleradelconejo5005
@lagaleradelconejo5005 4 жыл бұрын
17:06 Arranca la clase, se puede poner en x1.25
@FeTradingSolana
@FeTradingSolana Жыл бұрын
furfi lovers no es necesario este video :)
Lecture 14. SIMD (Vector Processors) - Carnegie Mellon - Comp. Arch. 2015 - Onur Mutlu
1:47:36
Carnegie Mellon Computer Architecture
Рет қаралды 20 М.
Lecture 12. Out of Order Execution - Carnegie Mellon - Comp. Arch. 2015 - Onur Mutlu
1:46:41
Carnegie Mellon Computer Architecture
Рет қаралды 24 М.
За кого болели?😂
00:18
МЯТНАЯ ФАНТА
Рет қаралды 3,4 МЛН
The IMPOSSIBLE Puzzle..
00:55
Stokes Twins
Рет қаралды 192 МЛН
Миллионер | 3 - серия
36:09
Million Show
Рет қаралды 2,2 МЛН
I thought one thing and the truth is something else 😂
00:34
عائلة ابو رعد Abo Raad family
Рет қаралды 12 МЛН
D. Richard Hipp - SQLite [The Databaseology Lectures - CMU Fall 2015]
1:07:08
CMU Database Group
Рет қаралды 36 М.
Lecture 25 - Main Memory and DRAM Basics - Carnegie Mellon - Computer Architecture 2013 - Onur Mutlu
1:35:16
Lecture 19. High Performance Caches - Carnegie Mellon - Comp. Arch. 2015 - Onur Mutlu
1:39:39
Carnegie Mellon Computer Architecture
Рет қаралды 12 М.
Lecture 11. Precise Exceptions, State Maintenance/Recovery - CMU - Comp. Arch. 2015 - Onur Mutlu
1:53:47
Carnegie Mellon Computer Architecture
Рет қаралды 15 М.
Lecture 22: Memory Controllers - Carnegie Mellon - Comp. Arch. 2015 - Onur Mutlu
1:45:39
Carnegie Mellon Computer Architecture
Рет қаралды 21 М.
Lecture 9. Branch Prediction I - Carnegie Mellon - Comp. Arch. 2015 - Onur Mutlu
1:51:57
Carnegie Mellon Computer Architecture
Рет қаралды 25 М.
16 - Concurrency Control Theory (CMU Databases Systems / Fall 2019)
1:23:08
CMU Database Group
Рет қаралды 23 М.
Lecture 15. GPUs, VLIW, Execution Models - Carnegie Mellon - Computer Architecture 2015 - Onur Mutlu
1:48:38
За кого болели?😂
00:18
МЯТНАЯ ФАНТА
Рет қаралды 3,4 МЛН