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

integrator circuit, Referring to Figure below, discuss how you would alter...

Referring to Figure below, discuss how you would alter the circuit to obtain: 1. a straightforward amplifier with gain 1, 2. a straightforward amplifier with gain 10, 3. a

Remote it support engineer windows systems administrator, Remote IT Support...

Remote IT Support Engineer Windows Systems Administrator Project Description: Need Windows base IT Support Engineer / Systems Network Administrator - perfectly MCSE qualified

BARBER SHOP PROBLEM, a) The barber shop has one barber, one barber chair, a...

a) The barber shop has one barber, one barber chair, and n chairs for waiting customers, to sit on. If there are no customers present, the barber sits down in the barber chair and

Explain the thread local storage (tls), Explain the Thread Local Storage (T...

Explain the Thread Local Storage (TLS)    Windows NT provides unique functions for per-thread data management. Thread local storage (TLS) is a concept defined in NT so develope

Describe the file system architecture-device driver, Device Drivers ...

Device Drivers Communicates straight with peripheral devices (disks, tapes, etc.). Responsible for begin physical I/O operations on the device. Pro

Explain general graph directory structure, General Graph Directory A s...

General Graph Directory A serious trouble with using an acyclic graph structure is making sure that there are no cycles. When links are further added to an existing tree struc

Virtual memory, In modern operating systems, applications do not directly a...

In modern operating systems, applications do not directly access the physical memory. Instead, they use so-called virtual memory, where each virtual address is translated to a phys

Explain acyclic graph directories and its implementation, Acyclic Graph Dir...

Acyclic Graph Directories In this kind of directory structure the shared directories or files can exist in the file system in two or more places at once. A tree structure excl

What is contiguous allocation, What is contiguous allocation? Allocati...

What is contiguous allocation? Allocation of a group of consecutive sectors for a one file.

Explain kernel-level threads (klt), KERNEL-LEVEL THREADS (KLT) In this...

KERNEL-LEVEL THREADS (KLT) In this level every thread management is done by kernel .No thread library except an API system calls to the kernel thread facility exists. The kern

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