a.
According to SPT rule the following sequence is applicable:
(schedule job with shortest processing time first, sequence the jobs in increasing order of processing time)
1st |
2nd |
3rd |
4th |
5th |
6th |
P1 |
P4 |
P3 |
P2 |
P5 |
P6 |
First determine Job start time = 0 (for first job) or Fi-1 for the jobs second onwards
Determine finish start time = Start time of job (Si) + Processing time (Pi) of job
Job Sequence |
Processing time |
Job start time |
Job Finish Time |
Job |
pi |
Si |
Fi = Si + Pi |
P1 |
1 |
0 |
1 |
P4 |
2 |
1 |
1+2 = 3 |
P3 |
2.5 |
3 |
3+2.5 = 5.5 |
P2 |
3 |
6 |
8.5 |
P5 |
4 |
9 |
12.5 |
P6 |
5 |
13 |
17.5 |
Total |
17.5 |
48 |
|
Flow Time |
Total flow time = 48
No. of Jobs = 8
Average Flow time = Total Flow time/no. of jobs = 48 / 6 = 8 hours
b.
Weighted Shortest Processing time Rule
1)determine ration of weight (Wj) to processing time (Pj)
2)arrange the jobs in decreasing order of Wj / Pj ratio (highest ratio job should be scheduled first)
Jobs (j) |
Processing Time (Pj) |
Weight (Wj) |
(Wj) / (Pj) |
Sequence |
P1 |
1 |
2 |
2 |
1st |
P2 |
3 |
1 |
0.333333 |
5th |
P3 |
2.5 |
1.5 |
0.6 |
3rd |
P4 |
2 |
3 |
1.5 |
2nd |
P5 |
5 |
2 |
0.4 |
4th |
Job Sequence |
Processing time |
Job start time |
Job Finish Time |
Job |
pi |
Si |
Fi = Si + Pi |
P1 |
1 |
0 |
1.000 |
P4 |
2 |
1 |
3.000 |
P3 |
2.5 |
3 |
5.500 |
P5 |
5 |
6 |
10.500 |
P2 |
3 |
11 |
13.500 |
Total |
13.5 |
33.500 |
Total flow time = 33.5
No. of jobs = 5
Average flow time = total flow time/No. of jobs = 33.5/5 = 6.70
Problem 5 is related to Lecture 16 Problem 5. SPT and WSPT (1.3 points) (a) The table below displ...
help please Individual Assignment 5 OPM101-08 VAMENG LOR nces Mailings Review View AaBbCcDdEe AaBbCcDdEe Normal No Spacing Problem 5. SPT and WSPT (1.3 points) (a) The table below displays the processing time for 6 projects Project Processing time (hours) P1 P2 P3 P4 P5 P6 2.5 Please use the Shortest Processing Time (SPT) rule to sequence the 8 projects. (0.2 points) Project P1 P2 P3 P4 P5 P6 Sequence Using the Shortest Processing Time rule, the average flow time of...
Table 1 shows the list of processes and burst time for each processesTable 1 ProcessBurst TimeP113P25P323P43P531P66P714 The processes are assumed to have arrived in the order of P1, P2, P3, P4, P5, P6 and P7 all at time 0. a) Calculate the average waiting time when each of the below scheduling algorithm is used. Assume that a quantum 8 is being used:i.) First Come, First Server (6 marks)ii.) Round Robin (6 marks)iii.) Shortest Job First, non preemptive (6 marks)
a) Using the SPT (shortest processing time) decision rule for sequencing the jobs, the order is (to resolve a tie, use the order in which the jobs were received): Sequence Job 1 ▼ N L M K O 2 ▼ K O L M N 3 ▼ K N L O M 4 ▼ N L M O K 5 ▼ N O K M L The total flow time for the sequence developed using the SPT rule = nothing...
luuent Name: 1. (100 points) Three processes P1, P2 and P3 with related information are given in the following table: Process Burst Time (ms) Arrival Time (ms) P1 T 0 P2 30 20 P3 20 T is a positive integer (T>0). Please use a non-preemptive shortest job first scheduling algorithm to make Gantt charts, and calculate different waiting times of three processes for different cases. Please write a professional perfect solution with detailed steps. 30
4. The below table shows four different processors P1, P2, P3, and P4 executing the same program with clock rates and average CPls as shown below. Answer the following showing all the steps. Processor Clock rate CP 1.0 GHz 4.0 GHz 3.0 GHz 2.0 GHz P1 3.0 P2 2.0 P3 1.5 P4 2.5 a. Which processor has the best performance in terms of execution time? (8 Points) b. If the program has 5000 instructions, what is the time spent on...
Problem 2 (6 points): Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): Job Processing Time (Days) Due Date (days from Now) A 2 2 B 5 6 C 6 10 D 9 6 E 4 8 What is the average flow time for the shortest processing time (SPT) rule schedule?
Assume a dynamic queue which is serviced by a Priority Based Round Robin algorithm such that there exists three priorities (1,2,3) which are used as multipliers of the basic time quantum value with the resulting number being the maximum service time the corresponding job will receive each time it gets the CPU. For a maximum amount of time equal to 1 basic time quantum , a priority 2 job gets the CPU for the maximum amount of time equal to...
Python 3 5. (16 points) Determine the big-O running time of each of the following functions: def pi (a) for i in range(len (a)): print (a[i]) for i in range(len(a)): print (ali]) def p2(a): for i in rangeClen(a)): for j in a: print (ati].j) def p3(a): for i in a: for j in a: print (i,j) def p4(a): for i in range(len(a)): pi(a) def p5(a): for i in range(len(a)): p3 (a) def p6(a): for i in range(len(a)): p5(a) def p7...
3. [Challenging Question - Scheduling for Rescuing Scuba Divers (20 pts)] Tom Cruise has worked as an operations manager of Underwater Treasure Discovery Company in Miami, FL and recently he was assigned to make a schedule to dispatch deep-water robots to save five scuba divers needing urgent rescue out of danger under the deep sea. He must do a very brief assessment of how urgent each diver appears and need to determine the best sequence to save all five scuba...
Create a class to represent a term in an algebraic expression. As defined here, a term consists of an integer coefficient and a nonnegative integer exponent. E.g. in the term 4x2, the coefficient is 4 and the exponent 2 in -6x8, the coefficient is -6 and the exponent 8 Your class will have a constructor that creates a Term object with a coefficient and exponent passed as parameters, and accessor methods that return the coefficient and the exponent. Your class...