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

Dual mode operation, WHAT ARE THE ADVANTAGES AND DISADVANTAGES OF DUAL MODE...

WHAT ARE THE ADVANTAGES AND DISADVANTAGES OF DUAL MODE OPERATION OF OPERATING SYSTEM>?

Analysis of Pseudocode Sempahore Solution, Gopher Gallery consists of a sho...

Gopher Gallery consists of a shopping mall and a cart ride that covers the 150 acre habitat. There are m visitors and n single-person vehicles. Visitors stroll around the mall at

Define program preemption, Define Program preemption The Forced de-allo...

Define Program preemption The Forced de-allocation of the CPU from a program which is executing on the CPU is known as Program preemption

How many disks can be used effectively by one fast wide bus, Q. More than ...

Q. More than one disk drive is able to be attached to a SCSI bus. Especially a fast wide SCSI-II bus can be connected to at most 15 disk drives. Remember that this bus has a bandw

Explain process scheduling in time sharing, Explain process scheduling in t...

Explain process scheduling in time sharing The relevant features of time sharing are: 1.      Process priorities do not depend on the nature of the processes 2.      Proc

Os installation, Question: OS Installation / File system a) Why is NTFS...

Question: OS Installation / File system a) Why is NTFS portioning preferred over FAT16 or FAT32 when security is of primary concern? b) State a situation or an application w

Explain working of the logical file system, Explain working of the logical ...

Explain working of the logical file system The logical file system manages metadata information. Metadata contains all of the file-system structure, excluding actual data. It h

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