Scribd
Upload
40 views2 pages

Weighted Round

1) The document describes a weighted round-robin scheduling approach for two sets of jobs (J1 and J2) where each set has two jobs and the second job in each set depends on the first job. 2) Using weighted round-robin scheduling, both sets of jobs can complete around time 4, whereas scheduling the jobs one after another could allow one set to complete by time 2 and the other by time 3. 3) For jobs where the output of the first is input to the second, round-robin scheduling is better as it allows both sets to complete portions after time 2 rather than having to wait for the full completion of the first job.

Uploaded by

narendra29000
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
40 views2 pages

Weighted Round

1) The document describes a weighted round-robin scheduling approach for two sets of jobs (J1 and J2) where each set has two jobs and the second job in each set depends on the first job. 2) Using weighted round-robin scheduling, both sets of jobs can complete around time 4, whereas scheduling the jobs one after another could allow one set to complete by time 2 and the other by time 3. 3) For jobs where the output of the first is input to the second, round-robin scheduling is better as it allows both sets to complete portions after time 2 rather than having to wait for the full completion of the first job.

Uploaded by

narendra29000
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Weighted Round-Robin Approach:

example consider two sets of jobs J1 = {J1, 1, J1 , 2} and J2 = {J2, 1, J2 ,


2}

 The release times of all jobs are 0


 The execution times of all jobs are 1
 J1, 1 and J2, 1 execute on processor P1

 J1, 2 and J2, 2 execute on processor P2

 Suppose that J1, 1 is the predecessor of J1, 2

 Suppose that J2, 1 is the predecessor of J2, 2

Figure (a) shows ‘weighted round-robin scheduling’ that both sets of jobs
complete approximately at time 4. If the jobs are scheduled in a weighted
round-robin manner one after the other, one of the chains can complete at
time 2 and the other at time 3 shown in figure (b).

Suppose that the result of the first job in each set is piped to the second job
in the set then second job be executed latter after each one or a few time
slices of the former complete. Then it is better to schedule the jobs on a
round-robin basis, because both sets can complete a few time slices after
time 2.

In a switched network a downstream switch can begin to transmit an earlier


portion of the message as soon as it receives the portion. It does not have
to wait for the arrival of the rest of the message. The weighted round-robin
approach does not require a sorted priority queue, only a round-robin
queue. This is a distinct advantage for scheduling message transmissions
in ultrahigh-speed networks since fast priority queues are very expensive

You might also like