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 test factory, Rational Test Factory is a component-based testing to...

Rational Test Factory is a component-based testing tool that automatically produces TestFactory scripts according to the application's navigational structure. TestFactory is integr

What problem does the namespace feature solve, Multiple providers of librar...

Multiple providers of libraries may use common global identifiers causing a name collision when an application tries to link with two or more such libraries. The namespace feature

Computer assignment problem, contributes to violence in our society. Others...

contributes to violence in our society. Others point out that television contributes to the high level of obesity among children. Now, we may have to add financial problems to the

Give brief summary of common aspects found in spreadsheets, Give brief summ...

Give brief summary of common aspects found in spreadsheets - It's made up of columns and rows; every row is identified by a number and every column is identified with a letter

Define race condition, Define race condition. When several process acc...

Define race condition. When several process access and manipulate similar data concurrently, then the outcome of the implementation depends on particular order in which the ac

Multiple layers of intranet security, Multiple Layers of Intranet Security ...

Multiple Layers of Intranet Security Security requirements vary from organisation to organisation. They also vary on the content that the organisations intend to place on their

Discuss the csma/cd and csma/ca protocols, Discuss the CSMA/CD and CSMA/CA ...

Discuss the CSMA/CD and CSMA/CA protocols. CSMA/CD: this is an access method used mainly with LANs configured in a bus topology. Along with CSMA/CD, any station (node) can se

Prolog programming language, Prolog Programming Language : Probably pr...

Prolog Programming Language : Probably programming languages are procedural: than the programmer specifies exactly the right instructions (algorithms) required to get an agent

Define a variant of top-down parsing without backtracking, A parser which i...

A parser which is a variant of top-down parsing without backtracking is? Ans. Recursive Descend is a variant of top-down parsing without backtracking.

Write a pseudocode for a program, Write a pseudocode for a program that acc...

Write a pseudocode for a program that accepts 10 numbers from a user and calculates the sum of all the numbers entered that are greater than or equal to 10.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages