15 213 The Class That Gives CMU Its Zip Introduction to Computer Systems David O Hallaron August 26 2003 Topics class01b ppt Staff text and policies Lecture topics and assignments Lab rationale and infrastructure CS 213 F 03 Teaching staff Instructors Prof David O Hallaron Prof Andreas Nowatzyk TA s Quarup Barreirinhaus Stavros Harizopoulos Matt Rosencrantz Nitin Sharma Come talk to us anytime Or phone or send email Joseph Trdinich Timothy Wong Course Admin Barb Grandillo WeH 4218 2 15 213 F 03 Textbooks Randal E Bryant and David R O Hallaron Computer Systems A Programmer s Perspective Prentice Hall 2003 csapp cs cmu edu Brian Kernighan and Dennis Ritchie 3 The C Programming Language Second Edition Prentice Hall 1988 15 213 F 03 Course Components Lectures Higher level concepts Recitations Labs 4 Applied concepts important tools and skills for labs clarification of lectures exam coverage The heart of the course 1 or 2 weeks Provide in depth understanding of an aspect of systems Programming and measurement 15 213 F 03 Getting Help Web www cs cmu edu afs cs academic class 15213 f02 www Copies of lectures assignments exams solutions Clarifications to assignments Newsgroup cmu cs class cs213 Clarifications to assignments general discussion Personal help 5 Professors door open means come on in no appt necessary TAs please mail or zephyr first 15 213 F 03 Policies Assignments Work groups You must work alone on all labs Handins Assignments due at 11 59pm on specified due date Typically 11 59pm Thursday evening to avoid 212 conflicts Electronic handins only Makeup exams and assignments OK but must make PRIOR arrangements with either Prof O Hallaron or Nowatzyk Appealing grades 6 Within 7 days of due date or exam date Assignments Talk to the lead person on the assignment Exams Talk to either Prof O Hallaron or Nowatzyk 15 213 F 03 Cheating What is cheating Sharing code either by copying retyping looking at or supplying a copy of a file What is NOT cheating Helping others use systems or tools Helping others with high level design issues Helping others debug their code Penalty for cheating 7 Removal from course with failing grade 15 213 F 03 Policies Grading Exams 40 Two in class exams 10 each Final 20 All exams are open book open notes Labs 60 7 labs 8 12 each Grading Characteristics Lab scores tend to be high Serious handicap if you don t hand a lab in We offer generous redemption programs 8 Tests typically have a wider range of scores 15 213 F 03 Facilities Assignments will use the Intel Computer Systems Cluster aka the fish machines 25 Pentium III Xeon servers donated by Intel for CS 213 550 MHz with 256 MB memory Rack mounted in the 3rd floor Wean Hall machine room We ll be setting up your accounts this week Getting help with the cluster machines 9 See course Web page for info Please direct questions to your TAs 15 213 F 03 Programs and Data 8 Topics Bits operations arithmetic assembly language programs representation of C control and data structures Includes aspects of architecture and compilers Assignments 10 L1 datalab Manipulating bits L2 bomblab Defusing a binary bomb L3 buflab Hacking a buffer bomb 15 213 F 03 Performance 2 Topics High level processor models code optimization control and data measuring time on a computer Includes aspects of architecture compilers and OS Assignments 11 L4 perlab Optimizing code performance 15 213 F 03 The Memory Hierarchy 2 Topics Memory technology memory hierarchy caches disks locality Includes aspects of architecture and OS Assignments 12 L4 perflab Optimizing code performance 15 213 F 03 Linking and Exceptional Control Flow 3 Topics Object files static and dynamic linking libraries loading Hardware exceptions processes process control Unix signals nonlocal jumps Includes aspects of compilers OS and architecture Assignments 13 L5 tshlab Writing your own shell with job control 15 213 F 03 Virtual Memory 4 Topics Virtual memory address translation dynamic storage allocation Includes aspects of architecture and OS Assignments 14 L6 malloclab Writing your own malloc package 15 213 F 03 I O Networking and Concurrency 6 Topics High level and low level I O network programming Internet services Web servers concurrency concurrent server design threads I O multiplexing with select Includes aspects of networking OS and architecture Assignments 15 L7 proxylab Writing your own Web proxy 15 213 F 03 Lab Rationale Each lab should have a well defined goal such as solving a puzzle or winning a contest Doing a lab should result in new skills and concepts Data Lab number representations logic bit manipulation Bomb Lab assembly using debugger understanding stack Perf Lab profiling measurement performance debugging Shell Lab understanding Unix process control and signals Malloc Lab understanding pointers and nasty memory bugs Proxy Lab network programming server design We try to use competition in a fun and healthy way 16 Set a threshhold for full credit Post intermediate results anonymized on Web page for glory 15 213 F 03 Autolab Web Service Labs are provided by the Autolab system Developed in summer 2003 by Dave O Hallaron Apache Web server Perl CGI programs Beta testing Fall 2003 With Autolab you can use your Web browser to 17 Review lab notes Download the lab materials Stream autoresults to a class status Web page as you work Upload handin your code for autograding by the Autolab server View the complete history of your code handins autoresult submissions autograding reports and instructor evaluations View the class status page 15 213 F 03 Good Luck 18 15 213 F 03
View Full Document
Unlocking...