Computer Architecture and Operating Systems
Course: Computer Architecture and Operating Systems (320202)
Instructors: Heinrich Stamerjohanns Jürgen Schönwälder [jabber]
TAs: Alen Stojanov, Jana Giceva, Gordan Dragi Ristovski
Lectures:
Monday 09:45 - 11:00 Lecture Hall, Research II
Wednesday 09:45 - 11:00 Lecture Hall, Research I
Start: February 2nd 2009
Contents:

The first part of the course provides an introduction to the concepts underlying operating systems. Students will develop an understanding how operating systems realize a virtual machine that can be used to execute multiple concurrent application programs and how concurrency problems can be solved. The second part of this course introduces core components (processors, memory systems, busses) and architectures of modern computing systems.

Topics: Computer architectures, processors, instruction sets, memory systems, system busses, parallel processing, operating system architectures, system calls and interrupts, concurrent processes and threads, scheduling, synchronization, deadlocks, virtual memory, file systems, inter-process communication, socket programming interface.

Course Materials:
Books:
  • D.A. Petterson, J.L. Hennesy, "Computer Organization & Design", 3rd Edition, Morgan Kaufman, 2005
  • D.A. Petterson, J.L. Hennesy, "Computer Organization & Design", 2nd Edition, Morgan Kaufman, 1998
  • A. Silberschatz, P.B. Galvin, B. Peter, G. Gagne, "Applied Operating System Concepts" John Wiley, 2000
  • A.S. Tanenbaum, "Modern Operating Systems", Prentice Hall, 2008
  • A.S. Tanenbaum, "Modern Operating Systems", Prentice Hall, 2001
  • W. Stallings, "Operating Systems: Internals and Design Principles", Prentice Hall, 2005
  • R. Love, "Linux Kernel Development", Sams Publishing, 2003
Links:
Schedule:
DateDateTopics
2009-02-02 2009-02-04 Introduction, System Calls, Processes, Threads
2009-02-09 2009-02-11 Synchronization (Semaphores, Condition Variables, Monitors)
2009-02-16 2009-02-18 Deadlocks, Scheduling
2009-02-22 2009-02-25 Memory Management (Segmentation, Paging, Virtual Memory)
2009-03-02 2009-03-04 File Systems
2009-03-09 2009-03-11 Inter-Process Communication (Signals, Pipes)
2009-03-16 2009-03-18 Inter-Process Communication (Sockets), Midterm
2009-03-23 2009-03-25 Introduction, History, Performance
2009-03-30 2009-04-01 Data and Program Representation
2009-04-06 2009-04-08 Spring Break
2009-04-13 2009-04-15 Spring Break, Processors
2009-04-20 2009-04-22 MIPS Instruction Set
2009-04-27 2009-04-29 Memory and Storage
2009-05-04 2009-05-06 Pipelining and Parallelism
2009-05-11 2009-05-13 Input and Output
Grading:

The final grade is made up of homeworks/projects (20%), bi-weekly quizzes (20%), mid-term exam (30%) and the final exam (30%). The homeworks and projects must be submitted individually. It is required to submit the solution for programming assignments electronically. Late submissions will not be accepted. Homeworks and project work may have to be defended in an oral interview.

Note 1: Students must submitted solutions individually.

Note 2: If you copy material verbatim from the Internet (or other sources), you have to provide a proper reference. If we find your solution text on the Internet without a proper reference, you risk to lose your points.

Note 3: Any cheating cases will be reported to the registrar. In addition, you will lose the points (of course).

Note 4: If you are unhappy with the grading, please report immediately (within one week) to the TAs. If you can't resolve things, contact the instructor. Problem reports which come late, that is after the one week period, are not considered anymore.

Electronic submission is the preferred way to hand in homework solutions. Please submit documents (plain ASCII text or PDF, no Word) and your source code (tar, zip) via the online grader system. If you have problems, please contact one of the TAs.

The overall percentage will be converted into Jacobs grades as follows:

PercentageGradeDescription
[95-100]1.00Excellent
[90-95)1.33Very Good
[85-90)1.67Very Good
[80-85)2.00Good
[75-80)2.33Good
[70-75)2.67Satisfactory
[65-70)3.00Satisfactory
[60-65)3.33Satisfactory
[55-60)3.67Sufficient
[50-55)4.00Sufficient
[45-50)4.33Sufficient
[40-45)4.67Failing
[ 0-40)5.00Failing

Any programs which have to be written will be evaluated based on the following criteria:

  • correctness including proper handling of error conditions
  • proper use of programming language constructs
  • clarity of the program organization and design
  • readability of the source code and any output produced

The policy on makeup quizzes and exams is the following: To be able to get a makeup, you have to either (a) have an official excuse from the registrar's office or (b) approach me well in advance of the quiz/exam with a very good reason for not being able to participate (e.g., because you take a GRE computer science subject test at the day of a quiz). Furthermore, I require that people take action to immediately contact me when they return to campus so that we can fix a date for the makeup. Once a week has passed, I do not feel obliged to offer a makeup anymore.

Assignments:
Exams:
  • Midterm Exam (2009-03-18 at 09:45, Campus Center East Wing)
  • Final Exam (2009-xx-xx at xx:xx)
    TBD