1.1.Great Indea Intro

1.CS61C intro

• The hareware is composed of a gazillion computers in parallel.
• The computers are consisted of parallel computers within the processing unit.
• We get parallelism all the way down the stack.

2.Abstraction

• Each level of abstraction is only influenced by the level above or below by one.
• We can change out the architecture and keep the same machine language to make program run faster.

3.Moore's law

• Moore's law: Over time, the number of transistors that's actual switches keeps growing exponentially.
• However, we hit a brick wall that getting more performance is no longer a matter of improving processes and adding transistors, but exploiting parallelsome.

4.Locality/Memory Hierarchy

• It's about how far away is a piece of data.

5.Parallelism

• We do lots of things at once, even within the most processor.
• On the program, we spilt things up.

• However, there's a limit called Amdahl's Law: The amount you can speed up something by parallelization depends on the amount that's actually parallelizable. If the problem isn't parallelizable, then it will fail.

6.Dependability via redundancy

• To deal with failures, we use redundancy so that a failing piece doesn't make the whole thing fail: