Create a gantt chart for scheduling algorithms, Operating System

Assignment Help:

Question:

(a) The following table (table 1.0) gives the length of the CPU burst time in milliseconds of processes P1 to P4. Assume the processes arrived in the order P1, P2, P3, P4 all at time 0.

414_Create a Gantt chart.png

Create a Gantt chart for each of the scheduling algorithms below showing when each process will be scheduled, and also determine the average waiting time for each of them.

I. First-Come-First-Server (FCFS)
II. A non preemptive Shortest Job First (SJF)

(b) Consider table 2.0, below:

1212_Create a Gantt chart1.png

Assume the processes arrived in the order P1, P2, P3, P4 at time shown and need the indicated burst time (both in milliseconds). Create a Gantt chart for the preemptive Shortest Job First (SJF) scheduling algorithm showing when each process will be scheduledand also determine the average waiting time for each process.

(c) Compare the average waiting time from part a (ii) for the nonpreemptive SJF algorithm with the average waiting time in part b for the preemptive version of SJF. Which algorithm results in the minimum average waiting time?

(d) The SJF algorithm tries to reverse the bias against short jobs found in FCFS scheme. Explain how is this achieved and what new problem is then inherent in the SJF algorithm in terms of processes? Is there any way to solve this inherent problem in the SJF algorithm?


Related Discussions:- Create a gantt chart for scheduling algorithms

SCAN SHUDULLING, EXPLAIN THE SCAN SHUDDULING WITH DIAGRAM

EXPLAIN THE SCAN SHUDDULING WITH DIAGRAM

Least-recently used, LRU evicts the page which was last accessed the farthe...

LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the rec

What is single-level directory, What is Single-level Directory All file...

What is Single-level Directory All files are constrained in the similar directory, which is simple to support and understood. One limitation is when the number of files enhance

CPU, TURNAROUND TIME

TURNAROUND TIME

Producer - consumer system, In this exercise we are going to use  pthread()...

In this exercise we are going to use  pthread()to simulate the dynamics between a warehouse, factory and retail. The factory produces product by using parts supplied by the warehou

Explain process states in the unix system, Process States A total of n...

Process States A total of nine states are acknowledged by the UNIX system. They are like as follow: User running                                                   Executing

Define properties of real time operating system, Define properties of Real ...

Define properties of Real time operating system Real time :- Often used in a dedicated application, this system reads information from sensors and must respond within a fixed a

Difference between message passing and shared memory, Problem: a) To en...

Problem: a) To ensure proper operation, the operating system and all the other programs must be protected from any malfunctioning program. Describe a mechanism which is impleme

Write a short note on memory management, Write a short note on Memory manag...

Write a short note on Memory management. Memory management includes reallocating and allocating the memory space. The kinds of allocation of memory FIXED PARTITIONING

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd