The assignments for the AOS are as follows:

1.
A task consists of several subtasks. If these subtasks communicate synch
ronously with each other frequently, which scheduling policy will suit for this
scenario and why?
2.
Describe distributed shared memory. Explain the algorithms that are deve
loped to implement DSM.
3.
What is the basic concept of Network File System? Discuss the features o
f Sun NFS distributed file System?
4.
Illustrate the working of token based Suzuki-Kasami algorithm with neat
diagram for synchronization in distributed environment.
5.
Explain the Ricart-Agrawala algorithm for distributed mutual exclusion.
What is the purpose of a REPLY message, and also state the condition under which
a site does not have to return a REPLY message. Construct a performance (consid
ering the metrics) table for all non-token based mutual exclusion algorithms.
6.

Draw and explain architecture of a Sun Network File System (NFS).

The last question will be asked from this assignment.