diff --git a/EDAF15-algimp/sammanfattnigar/Sammanfattning_Felix_Andy.md b/EDAF15-algimp/sammanfattnigar/Sammanfattning_Felix_Andy.md
index 460c54f..9473fd5 100644
--- a/EDAF15-algimp/sammanfattnigar/Sammanfattning_Felix_Andy.md
+++ b/EDAF15-algimp/sammanfattnigar/Sammanfattning_Felix_Andy.md
@@ -96,7 +96,11 @@ Common questions
     - The CPU will fetch the instructions for the guessed outcome of the
       branch. But it is not allowed to modify memory until it knows for certain
       that the branch was taken. If it was incorrect the instructions fetched are
-      simply ignored and the correct instructions are fetched.
+      simply ignored and the correct instructions are fetched. I.e. it uses
+      *register renaming* to avoid corrupting the actual registers until it
+      knows if the branch was taken or not. If it should predict wrong, it will
+      need to invalidate the instructions. For this, the *reorder buffer* is
+      used.
 * Why do we not have fully associative caches in CPUs?
     - We would need too many comparators (parallel lookup units) to find the
       wanted address. They would simply not fit on the silicon.