CS 61C Great Ideas in Computer Architecture Machine Structures Course Introduction Instructors Randy H Katz David A Patterson http inst eecs Berkeley edu cs61c sp11 01 14 2019 Spring 2011 Lecture 1 1 Agenda Great Ideas in Computer Architecture Administrivia PostPC Era From Phones to Datacenters Technology Break Warehouse Scale Computers in Depth 01 14 2019 Spring 2011 Lecture 1 2 Agenda Great Ideas in Computer Architecture Administrivia PostPC Era From Phones to Datacenters Technology Break Warehouse Scale Computers in Depth 01 14 2019 Spring 2011 Lecture 1 3 CS61c is NOT really about C Programming It is about the hardware software interface What does the programmer need to know to achieve the highest possible performance Languages like C are closer to the underlying hardware unlike languages like Scheme Allows us to talk about key hardware features in higher level terms Allows programmer to explicitly harness underlying hardware parallelism for high performance 01 14 2019 Spring 2011 Lecture 1 4 Old School CS61c 01 14 2019 Spring 2011 Lecture 1 5 Personal Mobile Devices 01 14 2019 New School CS61c Spring 2011 Lecture 1 6 Warehouse Scale Computer 01 14 2019 Spring 2011 Lecture 1 7 Old School Machine Structures Application ex browser Compiler Software Hardware Assembler Processor Operating System Mac OSX Memory I O system CS61c Instruction Set Architecture Datapath Control Digital Design Circuit Design transistors 01 14 2019 Spring 2011 Lecture 1 8 New School Machine Structures It s a bit more complicated Software Parallel Requests Assigned to computer e g Search Katz Parallel Threads Assigned to core e g Lookup Ads Hardware Harness Parallelism Achieve High Performance Warehouse Scale Computer Smart Phone Project 2 Parallel Instructions 1 instruction one time e g 5 pipelined instructions Parallel Data 1 data item one time e g Add of 4 pairs of words Hardware descriptions All gates functioning in parallel at same time 01 14 2019 Project 1 Computer Core Memory Core Cache Input Output Instruction Unit s Project 3 Core Functional Unit s A0 B0 A1 B1 A2 B2 A3 B3 Main Memory Spring 2011 Lecture 1 Logic Gates Project9 4 6 Great Ideas in Computer Architecture 1 2 3 4 5 6 Layers of Representation Interpretation Moore s Law Principle of Locality Memory Hierarchy Parallelism Performance Measurement Improvement Dependability via Redundancy 01 14 2019 Spring 2011 Lecture 1 10 Great Idea 1 Levels of Representation Interpretation High Level Language Program e g C Compiler Assembly Language Program e g MIPS Assembler Machine Language Program MIPS temp v k v k v k 1 v k 1 temp lw lw sw sw t0 0 2 t1 4 2 t1 0 2 t0 4 2 0000 1010 1100 0101 1001 1111 0110 1000 1100 0101 1010 0000 Anything can be represented as a number i e data or instructions 0110 1000 1111 1001 1010 0000 0101 1100 1111 1001 1000 0110 0101 1100 0000 1010 1000 0110 1001 1111 Machine Interpretation Hardware Architecture Description e g block diagrams Architecture Implementation Logic Circuit Description Circuit Schematic Diagrams Spring 2011 Lecture 1 01 14 2019 11 Predicts 2X Transistors chip every 2 years of transistors on an integrated circuit IC 2 Moore s Law Gordon Moore Intel Cofounder B S Cal 1950 01 14 2019 Spring 2011 Lecture 1 Year 12 Great Idea 3 Principle of Locality Memory Hierarchy 01 14 2019 Spring 2011 Lecture 1 13 Great Idea 4 Parallelism 01 14 2019 Spring 2011 Lecture 1 14 Great Idea 5 Performance Measurement and Improvement Matching application to underlying hardware to exploit Locality Parallelism Special hardware features like specialized instructions e g matrix manipulation Latency How long to set the problem up How much faster does it execute once it gets going It is all about time to finish 01 14 2019 Spring 2011 Lecture 1 15 Great Idea 6 Dependability via Redundancy Redundancy so that a failing piece doesn t make the whole system fail 1 1 2 1 1 2 2 of 3 agree 1 1 2 1 1 1 FAIL Increasing transistor density reduces the cost of redundancy 01 14 2019 Spring 2011 Lecture 1 16 Great Idea 6 Dependability via Redundancy Applies to everything from datacenters to storage to memory Redundant datacenters so that can lose 1 datacenter but Internet service stays online Redundant disks so that can lose 1 disk but not lose data Redundant Arrays of Independent Disks RAID Redundant memory bits of so that can lose 1 bit but no data Error Correcting Code ECC Memory 01 14 2019 Spring 2011 Lecture 1 17 01 14 2019 Spring 2011 Lecture 1 18 01 14 2019 Spring 2011 Lecture 1 19 Agenda Great Ideas in Computer Architecture Administrivia Technology Break From Phones to Datacenters 01 14 2019 Spring 2011 Lecture 1 20 Course Information Course Web http inst eecs Berkeley edu cs61c sp11 Instructors Randy Katz Dave Patterson Teaching Assistants Andrew Gearhart Conor Hughes Yunsup Lee Ari Rabkin Charles Reiss Andrew Waterman Vasily Volkov Textbooks Average 15 pages of reading week Patterson Hennessey Computer Organization and Design 4th Edition not 3rd Edition not Asian version 4th edition Kernighan Ritchie The C Programming Language 2nd Edition Barroso Holzle The Datacenter as a Computer 1st Edition Google Group 61CSpring2011UCB announce announcements from staf 61CSpring2011UCB disc Q A discussion by anyone in 61C Email Andrew Gearhart agearh gmail com to join 01 14 2019 Spring 2011 Lecture 1 21 Reminders Discussions and labs will be held this week Switching Sections if you find another 61C student willing to swap discussion AND lab talk to your TAs Partner only project 3 and extra credit OK if partners mix sections but have same TA First homework assignment due this Sunday January 23rd by 11 59 59 PM There is reading assignment as well on course page 01 14 2019 Spring 2011 Lecture 1 22 Course Organization Grading Participation and Altruism 5 Homework 5 Labs 20 Projects 40 1 Data Parallelism Map Reduce on Amazon EC2 2 Computer Instruction Set Simulator C 3 Performance Tuning of a Parallel Application Matrix Multiply using cache blocking SIMD MIMD OpenMP due with partner 4 Computer Processor Design Logisim Extra Credit Matrix Multiply Competition anything goes Midterm 10 6 9 PM Tuesday March 8 Final 20 11 30 2 30 PM Monday May 9 01 14 2019 Spring 2011 Lecture 1 23 EECS Grading Policy http www eecs berkeley edu Policies ugrad grading shtml A typical GPA for courses in the lower division is 2 7 This GPA would result for example from 17 A s 50 B s 20 C s 10 D s and 3 F s A class whose GPA falls outside the range 2 5 2 9 should be considered
View Full Document
Unlocking...