10-Feb-2004

Lecture Outline

Note: Only topics are listed here, make sure you see class notes for details
- Anoop Gupta

Monitors (cont...)

Bounded Buffer
- Hoare Style
- Mesa Style
- Java Style
- Java Style with notifyAll()

We have already covered implementation of processes, so read online notes.

Message Passing System

You are also required to read online notes

 - Advantages of Messages
- Old Problem
- New Problem
Overview of Message Passing
- Message
- Mailbox
- Operations
1. Naming
- Direct
- Indirect
2. Synchronization
- non-blocking Send
- non-blocking Receive
- blocking Send
- blocking Receive
- Common: non-blocking Send and blocking Receive
- Rendezvous: both Send and Receive are blocking
3 Buffering
4 Message Size

UNIX user level IPC - processes do not share memory, they communicate with pipes.

Deadlocks

You are also required to read online notes

- Why does it happen?
- Algorithm to detect deadlock in a graph
Representing deadlock
- Waits-for graph
- Resource Allocation graph
Four necesarry conditions
- Mutual Exclusion
- Hold and Wait
- No preemption
- Circular Wait
Handling Deadlocks (next lecture)
CS 537 - Introduction to Operating Systems (Spring 2004)                                                                                Anoop Gupta