Question

In: Computer Science

Assume, you are trying to execute the following jobs with execution times and their varying arrival...

Assume, you are trying to execute the following jobs with execution times and their varying arrival times are given. These jobs are run on a single processor using pre-emptive SJF algorithm. If the average waiting time of the processes is 4 millisecond, then the value of X is________. Show the equation with values that helps you to find the value of X.

Process No: J1 J2 J3 J4 J5 J6

Arrival time: 0 1 2 3 4 5

Burst Time: 7 5 3 1 2 X

Solutions

Expert Solution

The given data is:

Process No Arrival Time Burst Time
J1 0 7
J2 1 5
J3 2 3
J4 3 1
J5 4 2
J6 5 x

The average waiting time of all the 6 jobs is 4 ms.

The only possible value of the 'x' is 1.

If you have any doubts reagrding this answer, please reach out through the cooment section.


Related Solutions

Assume you have the following jobs to execute with one processor: i t(pi) Arrival Time 0...
Assume you have the following jobs to execute with one processor: i t(pi) Arrival Time 0 75 0 1 40 10 2 25 10 3 20 80 4 45 85 Using the table, assume the context switch time is five time units with RR scheduling. Create a Gantt chart illustrating the execution of these processes. What is the turnaround time for process p3? What is the average wait time for the processes?
Assume you have the following jobs to execute with one processor, with the jobs arriving in the order listed above.
i t(pi) 0 80 1 20 2 10 3 20 4 50 Assume you have the following jobs to execute with one processor, with the jobs arriving in the order listed above. Suppose a system uses FCFS scheduling. Create a Gantt chart illustrating the execution of these processes . b   What is the turnaround time for process p3? c.   What is the average wait time for the processes? Using the process load above, suppose a system uses SJN scheduling. d...
Assume you have the following jobs to execute with one processor: i t(pi) Priority 0 80...
Assume you have the following jobs to execute with one processor: i t(pi) Priority 0 80 2 1 25 4 2 15 3 3 20 4 4 45 1 The jobs are assumed to arrive at the same time. Using priority scheduling followed by FCFS, do the following: Create a Gantt chart illustrating the execution of these processes. What is the turnaround time for process p1? What is the average wait time for the processes?
Given the following mix of job, job lengths, and arrival times, assume a time slice of...
Given the following mix of job, job lengths, and arrival times, assume a time slice of 10 and compute the completion for each job and average response time for the FCFS, SJN, SRT, and Round Robin Scheduling Algorithm. jobs arrival time CPU cycle(ms) A 0 16 B 3 2 C 5 11 D 9 6 E 10 1 F 12 9 G 14 4 H 16 14 I 17 1 J 19 8
Consider the following set of jobs to be scheduled for execution on a single CPU system....
Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Burst (msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold)    (a)     Draw a Gantt chart showing First-Come-First-Served (FCFS) scheduling for these jobs. (b)     Draw a Gantt chart showing preemptive PRIORITY scheduling. (c)    Draw a Gantt chart showing Highest Response Ratio Next (HRRN) scheduling. (d)     Draw a...
Consider the following set of jobs to be scheduled for execution on a single CPU system....
Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Burst (msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold)    Draw a Gantt chart showing First-Come-First-Served (FCFS) scheduling for these jobs.       Draw a Gantt chart showing preemptive PRIORITY scheduling. Draw a Gantt chart showing Highest Response Ratio Next (HRRN) scheduling.     Draw a...
Consider the following set of jobs to be scheduled for execution on a single CPU system....
Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Burst (msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold)    (a)     Draw a Gantt chart showing First-Come-First-Served (FCFS) scheduling for these jobs. (b)     Draw a Gantt chart showing preemptive PRIORITY scheduling. (c)    Draw a Gantt chart showing Highest Response Ratio Next (HRRN) scheduling. (d)     Draw a...
Consider the following set of jobs to be scheduled for execution on a single CPU system....
Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Burst (msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold)    (a) Draw a Gantt chart showing First-Come-First-Served (FCFS) scheduling for these jobs. [3 Marks] Answer (a) 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15...
The following data yields the arrival and service times that each customer will require, for the...
The following data yields the arrival and service times that each customer will require, for the first 13 customers at a single server queue system (M/M/1). Upon arrival, a customer either enters service if the server is idle or joins the waiting line. When the server completes the work on a certain customer, the next one in line (i.e. the one who has been waiting the longest) enters the service. The studied period ends until the last customer leaves the...
4. Suppose that the following processes arrive for execution at the times indicated. Each process will...
4. Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use non-preemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process          Arrival Time           Burst Time P1                           0.0                                    8 P2                           0.4                                   4 P3                           1.0                                    1 a. What is the average turnaround time for these processes with the FCFS scheduling algorithm? b. What is the average turnaround time for these processes with the...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT