Question

given three tasks with indicated execution time requirment. show the round-robin scheduling of the cpu where...

given three tasks with indicated execution time requirment. show the round-robin scheduling of the cpu where the time slice is one tick. start with L1.

task execution requirment
L1 2
L2 4
L3 3
Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

At time t=0, L1 is scheduled for one tick.

At time t=1, L2 is scheduled for one tick.

At time t=2, L3 is scheduled for one tick.

At time t=3, L1 is scheduled for one tick. L1 finishes its execution.

At time t=4, L2 is scheduled for one tick.

At time t=5, L3 is scheduled for one tick.

At time t=6, L2 is scheduled for one tick.

At time t=7, L3 is scheduled for one tick. L3 finishes its execution.

At time t=8, L2 is scheduled for one tick. L2 finishes its execution.

0 0
Know the answer?
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
Similar Questions
Assuming FCFS and round robin scheduling algorithms, construct an example job mix with at least three...
Assuming FCFS and round robin scheduling algorithms, construct an example job mix with at least three jobs, such that all jobs have the same completion times. Your example should precisely state the arrival times of each job, their lengths, and the duration of the time slice for the round robin scheduler. Assume that the context switch overhead is zero
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 , Premtive PRIORITY Sheduling, Highest Response ratio Next (HRRN) and Round Robin(quantum=4). I need this in half hour
The following processes are being scheduled using a preemptive, round-robin scheduling algorithm. (20 Marks) Process    ...
The following processes are being scheduled using a preemptive, round-robin scheduling algorithm. Process     Priority Burst Time Arrival P1 40 20 0 P2 30 25 25 P3 30 15 30 P4 35 10 60 P5 5 10 100 P6 10 10 105 Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. In addition to the processes listed below, the system also has an idle task (which consumes no CPU resources and is identified...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Process Priority Burst...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Process Priority Burst Arrival P 1 8 15 0 P 2 3 20 0 P 3 4 20 20 P 4 4 20 25 P 5 5 545 P 6 5 15 55 Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highestpriority process. For processes with the same priority, a round-robin scheduler will be...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is assigned a numerical priority,with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Process            Burst Time Arrival Time...
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 16...
Suppose you are given a set S = {a1,a2,···,an} of tasks, where task ai requires pi...
Suppose you are given a set S = {a1,a2,···,an} of tasks, where task ai requires pi units of processing time to complete, once it has started. You have one computer on which to run these tasks, and the computer can run only one task at a time. Let ci be the completion time of task ai, that is, the time at which task ai completes processing. Your goal is to minimize the average completion time, that is, to minimize n1...
C++ Fix my code This code is for imitating the round robin cpu scheduling algorithim using...
C++ Fix my code This code is for imitating the round robin cpu scheduling algorithim using linked lists. Currently I am able to input processes and store / display them properly. The issue begins somewhere after I have displayed the processlist (I get a segmentation fault (core dumped) or the code doesnt seem to run). I have marked the location of where I think the issue begins with a comment. Please fix the code so that it is working properly....
The following process tasks, elemental times and precedence relationships are given. Initially, the company expects a...
The following process tasks, elemental times and precedence relationships are given. Initially, the company expects a forecasted demand of 50 units/hour. Find an assembly line that will produce the necessary output. Task Time (in seconds) Immediate Predecessor A 55 - B 30 A C 35 A D 22 B E 50 B,C F 15 C G 5 F H 10 G Part 2. Complete this exercise again, but this time the company expects a forecasted demand of 20 units/hour. Find...
1. Four workers are available to perform tasks 1-4. However, worker 1 can't do tasks 2,...
1. Four workers are available to perform tasks 1-4. However, worker 1 can't do tasks 2, 3, or 4. Also, worker 2 can't do tasks 3 or 4 and worker 3 can't do tasks 1, 3, or 4. Worker 4 can do any task. Each worker can do at most one task, and each task should be performed at most once. a) Draw the network for the maximum flow problem that can be used to determine whether all tasks can...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT