Computer Architecture and Operating Systems
Course: Computer Architecture and Operating Systems (320202)
Instructors: Heinrich Stamerjohanns Jürgen Schönwälder [jabber]
TAs: Vladislav Marinov, Anton Kirilov, Dan Alistarh
Lectures:
Monday 08:15 - 09:30 Lecture Hall, Research II
Wednesday 14:15 - 15:30 Lecture Hall, Research II
Start: February 5th 2007
Contents:

The first part of this 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 the 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", 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, 2001
  • W. Stallings, "Operating Systems: Internals and Design Principles", Prentice Hall, 2005
  • R. Love, "Linux Kernel Development", Sams Publishing, 2003
Links:
Schedule:
DateDateTopics
2006-02-05 2006-02-07 Operating System, System Calls, Processes, Threads
2006-02-12 2006-02-14 Synchronization (Semaphores, Condition Variables, Monitors)
2006-02-19 2006-02-21 Deadlocks, Scheduling
2006-02-26 2006-02-28 Memory Management (Segmentation, Paging, Virtual Memory)
2006-03-05 2006-03-07 File Systems
2006-03-12 2006-03-14 Inter-Process Communication (Signals, Pipes)
2006-03-19 2006-03-21 Inter-Process Communication (Sockets), MidTerm
2006-03-26 2006-03-28 Introduction, History, Performance
2006-04-11 Data and Program Representation
2006-04-16 2006-04-18 Processors
2006-04-23 2006-04-25 MIPS Instruction Set
2006-04-30 2006-05-02 Memory and Storage
2006-05-07 2006-05-09 Input and Output
2006-05-14 2006-05-16 Pipelining and Parallelism
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 may form groups and work together. However, solutions must be submitted individually and every submitted solution must list the names of the co-workers. If we find identical solutions where the listed co-workers are not consistent, you risk to loose your points.

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 loose your points.

Note 3: Any cheating cases will be reported to the registrar. In addition, you will loose 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 IUB 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
[41-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
Assignments:
Exams:
  • Midterm Exam (2007-03-21 at 14:15)
    Research II (Lecture Hall + Seminarroom)
  • Final Exam (TBD)