CS 213Introduction to Computer SystemsCourse OrganizationGuy Blelloch and Bruce MaggsJanuary 16, 2001Topics:• Staff, text, and policies• Lecture topics and assignments• Lab rationalCS 213 F’99class01b.pptCS 213 S’012class01b.pptTeaching staffInstructors– Prof. Guy Blelloch (Mon 2:30-3:30, WeH 7125)– Prof. Bruce Maggs (Mon 3:30-4:30, WeH 4123)TA’s– Umut Acar (Tue 3:00-4:00, WeH 4130)– Shaheen Ghandi (Wed 1:30-2:30, WeH 3108)– Urs Hengartner (Tue 10:30-11:30, WeH 4103)– David Koes (Tue 7:00-8:00, WeH 3108)Course Admin– Keith Ledonne (WeH 7166)These are the nominal office hours. Come talk to us anytime!(Or send email)CS 213 S’013class01b.pptTextbooksS. P. Harbison and G. L. Steele,• C: A Reference Manual• Fourth Edition• Prentice Hall, 1994Randy Bryant and David O’Hallaron,• Introduction to Computer Systems: A Programmer’s Perspective• To be published by Prentice Hall• alpha version of the text in the form of handouts• Your feedback on the notes is very important.CS 213 S’014class01b.pptCourse ComponentsLectures• higher level conceptsRecitations• applied concepts, important tools and skills for labs, clarification of lectures, exam coverageHomeworks• 1 week (individual)• solving a series of smaller problems, some programming• drills to provide practice for exams. Labs• multi-week (usually 2 weeks)• groups of up to 2 people• provide in-depth understanding of an aspect of systems• programming and measurementSome unavoidable overlap of labs and homeworks early in the course.CS 213 S’015class01b.pptGetting HelpWeb• www.cs.cmu.edu/afs/cs/academic/class/15213-s01/www• Copies of lectures, book chapter handouts, assignments, exams, solutions• Clarifications to assignments• Summaries of performance on exams and assignmentsNewsgroup• cmu.cs.class.cs213• Clarifications to assignments, general discussion Personal help• Professors: door open means come on in (no appt necessary)• TAs: please mail or zephyr first.CS 213 S’016class01b.pptPolicies: AssignmentsWork groups• You may do all labs in groups of up to 2, homeworks individuallyHandins• Assignments due at 11:59pm on specified due date.• Either 11:59pm Monday evening or 11:59pm Wednesday evening.• Electronic handins only.Makeup exams and assignments• OK, but must make PRIOR arrangements with eitherProf. Blelloch or Prof. Maggs.Appealing grades• Within 7 days of due date or exam date.• Assignments: Talk to the lead person on the assignment • Exams: Talk to either Prof. Blelloch or Prof. Maggs.CS 213 S’017class01b.pptPolicies: GradingExams (50%)• Two in class exams (12.5% each)• Final (25%)• All exams are open book/open notes.Assignments (50%)• 4 homeworks (~1 week, 2% each)• 5 labs (~2 weeks, 8-10% each)Grading Characteristics• Assignment scores tend to be high– Serious handicap if you don’t hand a lab in• Tests have big bearing on letter grade– Wider range of scores– Only chance for us to evaluate individual performanceCS 213 S’018class01b.pptFacilitiesAssignments will use 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 machine room.• We’ll be setting up your accounts this week.Getting help with the cluster machines:• See “Information about the Intel Cluster” on the 213 homepage.• Please direct questions to the CS Help Desk (identify yourself as a CS 213 student), – [email protected]– x8-4231 (24x7)– WeH 3613 9-5pmCS 213 S’019class01b.pptPart 1: Programs and data (12)Topics• Bit operations, arithmetic, assembly language programs, representation of C control and data structures, object files, processes, asynchronous processing, system programming• Includes aspects of of architecture, OS, and compilers Assignments• L1: Bit manipulation• L2: Defusing a binary bomb• H1: Human decompiler• H2: Floating point• H4: Concurrency (processes, threads, and signals)CS 213 S’0110class01b.pptPart 2: Memory (8)Topics• Memory management, memory technology, memory hierarchy, address translation• Includes aspects of architecture and OS.Assignments• L4: Dynamic memory allocation/garbage collection• H3: Address translationCS 213 S’0111class01b.pptPart 3: Performance (2)Topics• Code optimization (control and data), performance evaluation, benchmarking• Includes aspects of architecture and compilersAssignments• L3: Optimizing cache performanceCS 213 S’0112class01b.pptPart 4: I/O and Networking (5)Topics• Networking as the most interesting form of I/O.• Network technology, protocol stacks, TCP/IP, routing, sockets, internetworking, network programming, and Web programming.• Includes aspects of networking and architecture.Assignments• L5: network programmingCS 213 S’0113class01b.pptLab Rationale Each lab should have a well-defined goal such as solving a puzzle or winning a contest. • Defusing a binary bomb. • Winning a performance contest.• Being able to chat with your classmatesDoing a lab should result in new skills and concepts• Bit Manipulation: computer arithmetic, digital logic.• Bomb: assembly language, using a debugger. • Malloc/GC: understanding pointers and nasty memory bugs.• Cache: profiling, measurement, performance debugging.• Chat: network programming & performance, client/server computing.We try to use competition in a fun and healthy way.• Set a threshhold for full credit.• Post intermediate results (anonymized) on Web page for
View Full Document
Unlocking...