• Shuffle
    Toggle On
    Toggle Off
  • Alphabetize
    Toggle On
    Toggle Off
  • Front First
    Toggle On
    Toggle Off
  • Both Sides
    Toggle On
    Toggle Off
  • Read
    Toggle On
    Toggle Off
Reading...
Front

Card Range To Study

through

image

Play button

image

Play button

image

Progress

1/10

Click to flip

Use LEFT and RIGHT arrow keys to navigate between flashcards;

Use UP and DOWN arrow keys to flip the card;

H to show hint;

A reads text to speech;

10 Cards in this Set

  • Front
  • Back
Direct process communication
Processes must name each other explicitly:
send (P, message) – send a message to process P receive(Q, message) – receive a message from process Q

Links are established automatically

A link is associated with exactly one pair of communicating processes

Exactly one link between each pairs

The link may be unidirectional, but is usually bi-directional
Indirect process communication
Messages are directed and received from mailboxes (ports)

Each mailbox has a unique id

Processes can communicate only if they share a mailbox
Link established only if processes share a common mailbox

A link may be associated with many processes

Each pair of processes may share several communication links

Link may be unidirectional or bi-directional
List the three main process control issues.
1. Need for mutual exclusion

2. Deadlock

3. Starvation.
Detail mutual exclusion
2 or more processes need access to a non-sharable resource.

The resource is a critical resource; portion of the program that uses it is a critical section of the program.

OS may not understand and enforce this restriction because the requirements may not be obvious.
Detail deadlock
Two processes are waiting for the same resources.

Neither will release the resource that it already owns until it has acquired the other resource and performed the function requiring both resources.
Detail starvation
OS may grant access to resources to a number of processes while neglecting others.
List three degrees of process awareness
1. Processes unaware of each other

2. Processes indirectly aware of each other

3. Processes directly aware of each other
Processes unaware of each other control problems
Mutual exclusion, deadlock & starvation
Processes indirectly aware of each other control problems
Mutual exclusion, deadlock, starvation & data coherence
Processes directly aware of each other control problems
Deadlock & starvation