Process: process creation, waiting for a process, process termination, zombie process, orphan process, system call interface for process management – fork, vfork, exit, wait, waitpid, exec family,
Interprocess Communication: Kernel support for signals, IPC using pipes, FIFOs, message queues, semaphores and shared memory
Simulation of CPU Scheduling Algorithms
Multithreaded Programming and synchronization
Simulation of Deadlock Avoidance Algorithms
Simulation of page replacement algorithms

To learn how to create processes, and inter-process mechanisms

To understand the performance of various CPU scheduling algorithms such as FCFS, RR, SJN, SRTF, HRRN, Priority, Multilevel Queuing

To realize the need of process synchronization mechanisms

To evaluate various memory management techniques

Upon successful completion of this course a student will be able to:
1. understand inter-process communication techniques using message passing and shared memory
2. evaluate and compare various CPU scheduling algorithms
3. understand various synchronization tools such as semaphores and monitors and their applications
4. understand deadlock handling mechanisms
5. understand the implication of virtual memory and similar memory management techniques

W. Richard Stevens, Unix Network Programming: Interprocess Communications, Prentice Hall