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
What is bounded buffer

Now let's implement bounded producer-consumer with semaphores, a Coke machine which is initially empty: semaphore sem_mutex = 1 // binary semaphore for mutual exclusion, 1==unlo

Enhanced Second chance algorithm In this a modify bit is as well used. Now if the ordered pair of reference and modify is (0,0) neither recently used nor modified - the best

What are the operations of processes? Process creation A process may create several new processes. The creating process is called as parent process, where as the new proce


Q. Presume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p along with n distinct page numbers

Windows admin need it Project Description: We want to protect an executable on operating system level , so the process could be visible among all users while the executable r

Explain Busy Waiting Semaphores Weak, Busy-wait Semaphores a) The simplest way to implement semaphores. b) Useful while critical sections last for a short time, or we com

Question: (a) Briefly discuss and describe the possible RMI invocation semantics. (b) (i) What is data marshaling? (ii) Explain the role of a remote object reference dur

Explain segmentation hardware? We define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means