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
As mentioned earlier, the game engine will be used as the base of developing the Go game for the Android. This includes improving logic of the game, design good graphics and optim

What is a general graph? A tree structure where links can go from one branch to a node earlier in the similar branch or other branch, allowing cycles.

What is virtual memory? Virtual memory is a method that allows the execution of processes that might not be completely in memory. It is the separation of user logical memory fr

What is a reference string? An algorithm is evaluated by running it on a particular string of memory references and computing the number of page faults. The string of memory re

The dynamic memory allocator is a layer between the application and the OS, managing heap objects. When a program requests memory from the allocator (via malloc(), for instance), t

Determine a scheduling policy that is most suitable for a time-shared operating system   Round-Robin is a scheduling policy that is most suitable for a time-shared operating s

Explain the Novell NetWare     NetWare doesn't really have the concept of processes in the architecture, as  the most closely associated element in the NetWare  environment to

Single level directory: This is the easiest directory structure. All the files are controlled in the same directory, which is simple to support and understand. Few of the li

What is a file path name? A list of the subdirectories, directories, and files we must traverse to reach a file from the root directory.

what is a batch system give me answer in simple words so that i can understand