SYSTEM SOFTWARE
EECS 111, Course Code: 18050
Quarter: Spring Quarter 2010

Course Description

EECS 111 System Software (Credit Units: 4)
Multiprogramming, interrupt, processes, kernel, parallelism, critical sections, deadlocks, communication, multiprocessing, multilevel memory management, binding, name management, file systems, protection, resource allocation, scheduling.
Experience with concurrent programming, synchronization mechanisms, interprocess communication.

Prerequisites: EECS112; ICS 23 or EECS114.
Only one course from EECS111 and CSE104/Computer Science 143A may be taken for credit.
Formerly ECE142. (Design units: 2)

Course Objectives and Outcomes

• Course Objectives:

  • To understand the basic concepts that underlie operating systems.
  • To be able to use operating systems effectively.
  • To be able to design concurrent processes with proper synchronization.

• Course Outcomes:

  • Students will structure concurrent programs composed of processes and threads.
  • Students will describe basic CPU scheduling techniques.
  • Students will describe the principles and techniques for designing and analyzing
    • concurrent processes capable of correct synchronization among themselves.
    • concurrent processes capable of avoiding or recovering from deadlocks.
    • memory management mechanisms including virtual memory.

Course Resources

• Text book:
  

  A. Silberschatz, P. B. Galvin, G. Gagne: Operating System Concepts, 8th Edition, John Wiley & Sons, 2009. ISBN 978-0-470-12872-5

• Course web site
  online at http://eee.uci.edu/10s/18050/

Course Contents

Week	Topic	Reading
1	Introduction, course set up, overview	Ch. 1 - 2
2	Processes and threads	Ch. 3 - 4
3	CPU scheduling	Ch. 5
4	Process synchronization	Ch. 6
5	Deadlocks	Ch. 7
6	Memory management	Ch. 8
7	Virtual memory	Ch. 9
8	File system interface	Ch. 10
9	File system implementation	Ch. 11
10	I/O systems	Ch. 13



• Note that contents are tentative and may change.
• Please see the Schedule page for up-to-date scheduling information.

Course Policies

• Attendance Policy:

  Attendance and active participation is required for both lectures and discussions.

• Assignments:

  Assignments are listed on the Assignments course web page and will be assigned on a weekly or bi-weekly basis.
  Submission instructions and due dates will be listed with each assignment.
  The deadline for assignments is hard. Home work turned in after the due date will not be graded and will receive no credit.

• Exams:

  The course includes one midterm and one final examination scheduled as listed on the Schedule page.
  Final examinations are administered during examination week at the time announced by the Office of the Registrar.

• Grading Policy:

  The final grade for the course will be calculated as a weighted sum of the points scored in the assignments, the midterm, and the final examination, as follows:
  • 30% Assignments
  • 30% Midterm
  • 40% Final examination

• Academic Honesty:

  The complete policy statement on academic honesty is published in the Schedule of Classes.
  Dishonesty and plagiarism will not be tolerated.