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
Explain the Advantage of Assembly Language The advantages of assembly language program is: a)    Reduced errors  b)    Faster translation times  c)    Changes could be ma



Q. How does DMA raise system concurrency? How does it make difficult hardware design? Answer: DMA increases system concurrency by allowing the CPU to perform tasks while the

How can deadlocks be represented? Deadlocks are able to be described in terms of a directed graph called as a system resource-allocation graph. This graph contains of the foll

How can the deadlock be prevented? To evade deadlocks first we will have to obtain the information about how resources are to be requested. And as well we should make sure that

Determine an imperative statement Imperative statement points out an action to be carried out during execution of assembled program

Determining the time quantum for a job is a critical task. Given the assumptions that the average switching time between processes is s, and the average amount of time an I/O bo

Q.  When virtual memory is executed in a computing system there are convinced costs associated with the technique and certain benefits. List the costs as well as the benefits. Is i

Q. In the IBM/370 memory protection is offered through the use of keys. A key is a 4-bit quantity every 2K block of memory has a key (the storage key) associated with it. The CPU