Winter 2019, Zemoudeh
CSE 460: Operating Systems
School of Computer Science and Engineering
California State University, San Bernardino

Last modified: Wednesday, Mar 6

Homework 4, Due Mon, Mar 18 NO LATE SUBMISSION
Exercises 4.8, 4.14, 4.16
Give a solution to the semaphore problem for 3 processes where P1 and P2 cannot be in their critical sections at the same time, and P2 and P3 cannot be in their critical sections at the same time, but P1 and P3 are free to be in their critical sections at the same time.
Exercise 6.16

Homework 3, Due Wed, Mar 6
Exercises 8.20, 8.23, 8.28, 9.21, 9.22

Associative Memory

Phase II Solution

Phase III: Due Mon Lab, Mar 18; Wed Lab, Mar 13.

Java socket programs and

Sample MPI program hello.c

Midterm: Wednesday, Feb 13

Good references for Memory Mapped Files and Shared Memory.

Programs for shared memory and producer-consumer problem:

Phase I Solution

exec() system calls used in Figure 3.9 exec3.9.c

Homework 2, Due Mon, Feb 4
Exercises 2.8, 2.21, 3.5, 3.12, 3.17.

Phase II: Due Mon Lab, Feb 18; Wed Lab, Feb 20.

Examples of fork() and pipe() system calls:

Homework 1, Due Wed, Jan 23
Exercises 1.6, 1.12, 1.19, 1.20, 1.27

Phase I: Due Mon Lab, Jan 28; Wed Lab, Jan 30.

Overflow Detection Overflow is not the same as final carry.

Phase 1 Help Programs DO NOT COPY AND PASTE! Type-in the programs and complete by replacing ellipsis (...) with your own code.