ZuoTi.Pro
Question

Q1. Consider the following jobs having I/O wait of 70% with Arrival time and CPU minutes needed. 40 Marks Jobs Arrival Time 1

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Here, based on the given task set, we task are scheduled on the basis of their arrival i.e first come first server basis.

  1. Since all arrive at 13:XX , the 13 until of time is related, hence the arrival time is taken with respect to 13 i.e arrival time will be 10, 30, 40, 50, and 55 units of time.
  2. Based on this data , the Graph when the jobs are arrived and completed is given below :

5 6 8 9 11 12 18 19 10 A 1/8 A 13 A 4/8 14 А 5/8 15 А 6/8 16 A 718 17 А. 8/8 0/0 0/0 0/0 0/0 0/0 0/0 0/0 0/0 0/0 0/0 18 3/8 0

Based on this graph , the

CPU idle

= Number of empty slots in the graph / Total number of slots in the graph =  

= 34 / 59 = 57.62 %

CPU busy

= Number of filled slots in the graph / Total number of slots in the graph

= 25 / 59 = 42.38 %

CPU busy/ process

=  Number of filled slots in the graph / Number of process scheduled

= 25 / 5 = 5

0 0
Add a comment
Know the answer?
Add Answer to:
Q1. Consider the following jobs having I/O wait of 70% with Arrival time and CPU minutes...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Consider the following jobs having I/0 wait of 70% with Arrival time and CPU minutes needed....

    Consider the following jobs having I/0 wait of 70% with Arrival time and CPU minutes needed. Calculate CPU idle, CPU busy and CPU busy/ process. Draw a graph showing no. of jobs and when it completes. Jobs Arrival Time CPU minutes needed 13:10 8 2 13:30 6 3 13:40 4 4 13:50 4 5 13:55 3

  • 1. Consider the following jobs having I/0 wait of 70% with Arrival time and CPU minutes...

    1. Consider the following jobs having I/0 wait of 70% with Arrival time and CPU minutes needed. Draw a graph showing no. of jobs and when it completes. Jobs Arrival Time CPU minutes needed 13:10 8 2 13:30 6 3 13:40 4 4 13:50 4 5 13:55 3

  • Q2. Consider the following processes with arrival time and burst time. 20 Marks Process Arrival Time...

    Q2. Consider the following processes with arrival time and burst time. 20 Marks Process Arrival Time Burst Time P16 29 0.0 P21 19.0 12 P32 22.0 13 P41 30.0 25 Calculate waiting time and average waiting time Round Robin (R-R) scheduling algorithm by using the following Quantum/Time slice: a. Quantum/Time Slice = 8 b. Quantum/Time Slice = 16 Q3. Calculate the CPU Utilization and Idle time by considering 35% I/O wait and number of processes are from 1 to 5....

  • Assume that you have four different processes with the following attributes: Process   Arrival time.   CPU Burst....

    Assume that you have four different processes with the following attributes: Process   Arrival time.   CPU Burst.   I/O Burst Total CPU time A. 0 4 4 9 B 3 2 3 7 C 6 5 1 11 D 12 1 1 5 As we did in class, perform a scheduling simulation using these four processes according to the following algorithms: 1) First Come First Serve 2) Round Robin with time slice = 1 3) Round Robin with time slice = 3...

  • Five processes arrive to run on a CPU. The scheduler puts them in its data structure....

    Five processes arrive to run on a CPU. The scheduler puts them in its data structure. The table below lists the processes, how much CPU time each will need, and the priority of each process. One(1) is the highest priority and 4 is the lowest priority. Process CPU time needed Priority P1 P2 P3 NNW-W a. The scheduler uses First Come First Serve to schedule the jobs. Fill in the time line below showing at what time each process starts...

  • Question 1 Simulate the operation of a first-in-first-out queuing system until time TE = 30 minutes,...

    Question 1 Simulate the operation of a first-in-first-out queuing system until time TE = 30 minutes, using the interarrival and service-times given below (in minutes) in the given order. Interarrival times: 4, 3, 1, 1, 5, 7, 10 Service times: 4, 4, 6, 9, 8, 7, 4, 6 Given that the first arrival occurs at time t = 0, create a record of hand simulation (on the table given in the last page) using the event-scheduling algorithm and compute the...

  • Consider a simple queuing system in which customers arrive randomly such that the time between successive...

    Consider a simple queuing system in which customers arrive randomly such that the time between successive arrivals is exponentially distributed with a rate parameter l = 2.8 per minute. The service time, that is the time it takes to serve each customer is also Exponentially distributed with a rate parameter m = 3 per minute. Create a Matlab simulation to model the above queuing system by randomly sampling time between arrivals and service times from the Exponential Distribution. If a...

  • Consider a bank branch that has three distinct customer arrival patterns throughout the day, as measured...

    Consider a bank branch that has three distinct customer arrival patterns throughout the day, as measured by average arrival rates (below) Morning (8:30 11:30): 40/hour Lunch (1:30-1:30): 60/hour Afternoon (1:30 4:00): 3 35/hour. Regardless of the time of day, the average time it takes for a teller to serve customers is 2 minutes, 52 seconds Because of competition with other banks in the area, management has determined that they want to keep the average customer wait before service to be...

  • Implement the following 3 CPU scheduling algorithms Simulate and evaluate each with the set of eight...

    Implement the following 3 CPU scheduling algorithms Simulate and evaluate each with the set of eight processes below. Use any programming language. The program listing should be submitted with the report. FCFS (First Come First Serve) non-preemptive (partial results provided) SJF non-preemptive MLFQ Multilevel Feedback Queue (absolute priority in higher queues)             Queue 1 uses RR scheduling with Tq = 5             Queue 2 uses RR scheduling with Tq = 10             Queue 3 uses FCFS All processes enter first...

  • 1. The mean arrival rate of flights at O’Hara International Airport in marginal weather is 195...

    1. The mean arrival rate of flights at O’Hara International Airport in marginal weather is 195 flights per hour with a population standard deviation of 13 flights per hour. To increase arrivals, a new air traffic control procedure is implemented. In the next 30 days of marginal weather, the mean number of arrivals increased to 200. Given this information, please answer the following questions: A. Compute the standard error of the sampling distribution of mean arrival rates? B. What assumption...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT