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
Second-Chance algorithm When a page has been selected, we inspect its reference bit. If the value is 0, we proceed to replace this page. If the reference bit is set to 1, thoug

Additional Reference bits algorithm Here we keep an 8-bit byte for every page in memory. At standard intervals the reference bit is shifted by the OS. If a shift register conta

What is the exclusive feature of UNIX Shell is the exclusive feature of UNIX.

Suppose your process starts up, and allocates some memory with malloc(). The allocator will then give part of a memory page to your process. The OS then updates the corresponding p

Define deadlock avoidance. An alternative method for avoiding deadlocks is to need additional information about how resources are to be requested. Every request requires the sy

Q. A CPU scheduling algorithm determined an order for the execution of its scheduled processes. Convinced n processes to be scheduled on one processor how numerous possible differ

What are the requirements to be satisfied by the critical section problem? Following are the necessities to be satisfied by the critical section problem: a)      Mutual exc

What is a client server system? Centralized systems proceed as server systems to satisfy request generated by client systems Server system is able to be broadly div

Dynamic scheduling : The number of thread in a program may be changed during the course of operation. Dynamic priority scheduling is a kind of scheduling algorithm in which the pr

How a virtual memory can be implemented? What are the benefits of using virtual memory?