2019.5.2
笔者是19年9月入学的硕士，很弱的那种...目前在疯狂补基础中..
欢迎志同道合的同学一起交流学习进步.
这一个系列是学CMU 15-213 Intro to Computer Systems整理的重点PPT导图，后续还补点书本重点
课程资源：http://www.cs.cmu.edu/afs/cs/academic/class/15213-f15/www/index.html
课程视频：https://www.bilibili.com/video/av24540152
实验资源：http://csapp.cs.cmu.edu/3e/labs.html
看了知乎、豆瓣评论，整个CMU 15-213的核心是下面是7个实验：
Data Lab、Bomb Lab、Attack Lab、Cache Lab、Shell Lab、Malloc Lab、Proxy Lab
慢慢肝，保证每天都有进步，加油！！！
目录
3.How the course fits into the CS/ECE curriculum
readme.pdf
PPT : Design，
Style for Figure Labels、Style for Code、Linux Command Prompt、Stack and Registers、Bar Plot、Tables、Color Palette
Overview.pdf
1.Course theme
p3 Abstraction & Reality
2.Five realities
| p4-p5 | Reality #1 : Ints are not Integers, Floats are not Reals (1)Example 1: Is x2 ≥ 0? (2)Example 2: Is (x + y) + z = x + (y + z)? Computer Arithmetic (1)Does not generate random values (2)Cannot assume all “usual” mathema7cal proper7es (3)Observa7on |
| p6 | Reality #2 : You've Got to Know Assembly (1)Chances are, you’ll never write programs in assembly (2)But: Understanding assembly is key to machine-level execution model |
| p7-p10 | Reality #3 : Memory Matters. Random Access Memory Is an Unphysical Abstraction (1)Memory is not unbounded (2)Memory referencing bugs especially pernicious (3)Memory performance is not uniform Memory Referencing Bug Example Memory Referncing Errors (1)C and C++ do not provide any memory protec7on (2)Can lead to nasty bugs (3)How can I deal with this? |
| p11-p13 | Reality #4 : There's more to performance than asymptotic complexity (1)Constant factors ma\er too! (2)And even exact op count does not predict performance (3)Must understand system to op7mize performance Memory System Performance Example Why The Performance Differs |
| p14 | Reality #5 :Computers do more than execute programs (1)They need to get data in and out (2)They communicate with each other over networks |
3.How the course fits into the CS/ECE curriculum
p15 -p18 Role within CS/ECE Curriculum、Course Perpective、nstructors、15-513 vs 15-213 and 18-213
4.Academic integrity
p19-p20 Cheating
p21 Textbook
p22 Course Components：Lectures、Recitations、Labs、Exams
p23-p26 Getting Help、Pliciies:Labs and Exams、Facilities
p27-p29 Temeliness、Other Rules of the Lecture Hall、Policies:Grading、
| p30 | Programs and Data L1 (datalab): Manipula;ng bits |
| p31 | The Memory Hierarchy L4 (cachelab): Building a cache simulator and op;mizing for locality. |
| p32 | Exceptonal Control Flow L5 (tshlab): Writng your own Unix shell. |
| p33 | Virtual Memory L6 (malloclab): Writng your own malloc package |
| p34 | Networking, and Concurrency |
p35-p38 Lab Ratonale、Autolab、Autolab account、Waitlist questions