Give an example of shortest job next scheduling, Computer Engineering

Assignment Help:

Consider the following set of jobs with their arrival  times, execution time (in minutes), and deadlines.

Job Ids

Arrival Time

Execution time

Deadline

1

0

5

5

2

1

15

25

3

3

12

10

4

7

25

50

5

10

5

12

Calculate the mean turn-around time, the mean weighted turn-around time and the throughput for SJN.

Chart for Shortest Job next scheduling (SJN)

1

3

5

2

4

0        5                         17         22                                        37                                                           62

Turnaround time for different jobs is

For job 1, T1 = 5-0=5 unit time

For job 2, T2 = 37-1=36 unit time

 For job 3, T3 = 17-3=14 unit time

For job 4, T4 = 62-7=55 unit time

For job 5, T5 = 22-10=12 unit time

Mean turnaround time, Tm = (T1+T2+T3+T4+T5)/5= 122/5= 24.4unit time/job

Throughput= no of process completed per unit time= 5/62= 0.081 jobs/unit time.


Related Discussions:- Give an example of shortest job next scheduling

What is ai checkers, The major programs here are Arthur Samuel's, the rote ...

The major programs here are Arthur Samuel's, the rote learning method which is a lot like a memory based method, generalization learning which is a lot like backprop and a signatur

Define syntax of mpi_scan function, Q. Define syntax of MPI_Scan  function...

Q. Define syntax of MPI_Scan  function? MPI_Scan (Sendaddr,, Receiveaddr , count, datatype, op, comm): It merges the partial values in p final results that are received in

Name some popular storage devices, Name some popular storage devices In...

Name some popular storage devices In contrasts with storage, which 1) retains data and programs irrespective of whether they are currently in use or not, (2) retains data

Control hazard and delayed branching, Described Instruction or control haza...

Described Instruction or control hazard? Ans: The pipeline can be stalled due to delay in the availability of an instruction. For instance, this may be a result of a miss in t

Illustrate working of t flip-flop, Q. Illustrate working of T Flip-Flop? ...

Q. Illustrate working of T Flip-Flop? T (Toggle) flip-flop is attained from JK flip-flop by combining inputs J and K together. The implementation of T flip-flop is displayed in

Sort Wars, If quicksort is so quick, why bother with anything else? If bubb...

If quicksort is so quick, why bother with anything else? If bubble sort is so bad, why even mention it? For that matter, why are there so many sorting algorithms?

What is rom, What is ROM? Read only memory [ROM] is used for storing pr...

What is ROM? Read only memory [ROM] is used for storing programs that are permanently resident in the computer and for tables of constants that do not change in value as the pr

Explain cocomo model, A COCOMO model is :- COCOMO:- Constructive Cost Es...

A COCOMO model is :- COCOMO:- Constructive Cost Estimation Model.

Explain stored program control, Explain Stored Program Control. Stored...

Explain Stored Program Control. Stored Program Control: Modern digital computers utilize the stored programmed idea. Now, a program or a set of instructions to the computer i

Bit pair recoding and 2’s complement, Explain bit pair recoding with an exa...

Explain bit pair recoding with an example? Ans: Bit pair recoding halves the maximum number of summands. Group the Booth-recoded multiplier bits in pairs and see the following

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