Give the example of first come first served 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 FCFS

Chart for First Come First Served scheduling (FCFS)

1	2	3	4	5
0 5 20 32 57 62

Turnaround time = Terminated time - Arrival time i.e. T = Tr - Ta

Therefore, turnaround time for different jobs is

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

For job 2, T2 = 20-1=19 unit time

For job 3, T3 = 32-3=29 unit time

For job 4, T4 = 57-7=50 unit time

For job 5, T5 = 62-10=52 unit time

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

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

Related Discussions:- Give the example of first come first served scheduling

Explain what are the different hazards, There are situations, called hazard...

There are situations, called hazards that stop the next instruction in the instruction stream from implementing during its designated clock cycle. Hazards decrease the performance

Multisim simulation file, Build the circuit using the Asynchronous Counter ...

Build the circuit using the Asynchronous Counter Technique with JK FF and relevantgates capable of executing the counting sequence as {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}Simulate the cir

A subroutine can be terminated unconditionally using exit, A subroutine can...

A subroutine can be terminated unconditionally using EXIT. True.

Explain about magnetic tape, Explain about Magnetic tape a) They a...

Explain about Magnetic tape a) They are mostly used for keeping files of data b )It is one of the cheapest and slowest methods for storage

Discuss the 5-level switching hierarchy recommended by ccitt, Discuss the 5...

Discuss the 5-level switching hierarchy recommended by CCITT. Hierarchical networks are able of handling heavy traffic where needed, and at similar time use minimal number of t

Determine about the memory stack, Memory Stack Stack could exist as a s...

Memory Stack Stack could exist as a stand-alone unit or could be executed in a random-access memory attached to the CPU. The implementation of a stack in a CPU is done by assig

How to information transfer from one register to another, Q. How to Informa...

Q. How to Information transfer from one register to another? Information transfer from one register to another is designated in symbolic notation by a replacement operator. For

Illustrate minimization of gates, Q. Illustrate Minimization of Gates? ...

Q. Illustrate Minimization of Gates? The generalization of Boolean expression is much useful for combinational circuit design. The subsequent three techniques are used for this

How can a function return a pointer to its calling routine, How can a funct...

How can a function return a pointer to its calling routine? The general form of a function is: type_specifier function_name(parameter list) { body of function; }

Bus master - computer architecture, Bus Master: In computer system, ...

Bus Master: In computer system, bus mastering is a attribute supported by various bus architectures that enables a device linked to the bus to initiate transacti

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages