Prepare gantt charts and determine the average waiting time, Operating System

Prepare Gantt Charts and Determine the Average Waiting Time

1. Classify the interaction among the processes on the basis if degree to which they are aware of each  other's existence (i.e., processes totally unaware of each other, indirectly aware of each other, and Directly aware of each other). Also list the consequences of each.

2. a) Compare various CPU scheduling algorithms (particularly: FCFS, SJF, and RR) on the grounds of throughput, response time, overhead, mode (pre-emptive or non-pre-emptive), starvation factor, fairness level to certain processes.

b) Also, prepare Gantt charts and determine the average waiting time for the following set of processes using FCFS, SJF (non-pre-emptive) and RR (quantum=4 ms):

Process Name:

P1

P2

P3

P4

P5

P6

Burst Time (in ms):

5

12

7

2

10

4

3. Using an example, demonstrate how semaphores and monitors can be used to synchronize two or more cooperating processes in the system.

4. Consider the following Processes P1 and P2:

2455_Prepare Gantt Charts and Determine the Average Waiting Time.png

Above processes are incorporated with a memory variable turn common to both processes just for the sake of synchronization and that these two processes do not enter into their critical section at the same time.

State whether it as a requisite solution and that it satisfies the requirements of the solution to.

Posted Date: 2/28/2013 12:46:24 AM | Location : United States







Related Discussions:- Prepare gantt charts and determine the average waiting time, Assignment Help, Ask Question on Prepare gantt charts and determine the average waiting time, Get Answer, Expert's Help, Prepare gantt charts and determine the average waiting time Discussions

Write discussion on Prepare gantt charts and determine the average waiting time
Your posts are moderated
Related Questions

Prepare a report that motivates alternatives reactive strategies that can be used by wind Mud clothing factory

Acyclic Graph Directories In this kind of directory structure the shared directories or files can exist in the file system in two or more places at once. A tree structure excl

Processes and Programs Process is a dynamic entity which is a program in execution. A process is a sequence of information executions. Process exists in a limited span of t

How does an operating system make multiprogramming possible by using single processor?

Q. Explain about diffrent Process State? Process State When process executes, it changes its state. Process state is defined as the current activity of the process. Fi

The producer-consumermodel above has a standard human analogy of an assembly line. Humans have specialized skills, however, whereas threads running the same program do not need to

Explain the Resource Ownership by Platform Ownership of data items may further be complicated by concepts defined in certain operating systems. Each operating system defines "p

Q. Researchers have recommended that instead of having an access list associated with each file (specifying which users can access the file and how) we should have a user control

Explain the Spawnvp Function used in the netware Spawnvp(flags, execNmae, argv)   This function executes  similarly to spawnlp( ) except that parameters are passed as a v