PDF format

Problem 6 (25 Points)
Consider a system that has W workers and M managers that continuously enter and
leave an office. Work can only be done in teams consisting of 1 manager and 2 workers
in the office. The detailed requirements are:
• Managers arrive to a FCFS queue, and workers arrive to their own FCFS queue.
• When the manager at the front of the queue is ready, he/she picks the next two
workers for his team and tells them to begin working. Then, the next manager
can form his/her team in a similar manner.
• Workers tell their manager when they are done working and leave immediately.
• A manager does not leave until all team members have said they are leaving.
• After work is completed, the team members leave for a random amount of time
before re turning.
a) Describe the synchronization for the manager process by writing the manager
process in terms of the counting semaphore primitives Signal() and Wait() and
the semaphore and variable declarations. Note: You do not need to give the
worker process code; i.e., you can assume that the worker process is given.
b) Describe the use of each semaphore and the general logic of the manager
process. You can do that using comments in your code.
HINT: (Note: You may use the following skeleton.)
struct {
int manager;
int worker[2];
int n=0;
} newTeam;
// shared
// manager of new team
// which workers are forming a new team
// how many entries in worker[2]
... semaphore definitions ...
Page 3 of 4