Optimal Priority Assignment Algorithm for each priority leve
157K - views

Optimal Priority Assignment Algorithm for each priority leve

brPage 1br brPage 2br Optimal Priority Assignment Algorithm for each priority level lowest first for each unassigned task if is schedulable at priority assign to priority break co

Download Pdf

Optimal Priority Assignment Algorithm for each priority leve




Download Pdf - The PPT/PDF document "Optimal Priority Assignment Algorithm fo..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.



Presentation on theme: "Optimal Priority Assignment Algorithm for each priority leve"— Presentation transcript:


Page 1

Page 2
Optimal Priority Assignment Algorithm for each priority level , lowest first { for each unassigned task { if is schedulable at priority { assign to priority break (continue outer loop) } } return unschedulable } return schedulable
Page 3

Page 4

Page 5
Robust Priority Assignment Algorithm for each priority level , lowest first { for each unassigned task { binary search for the largest value of for which task is schedulable at priority } if no tasks are schedulable at priority return unschedulable else assign the schedulable task

that tolerates the max at priority to priority } return schedulable Figure 1: Transformation of priority order
Page 6
Table 1: Task parameters
Page 7
Table 2: Computed values of Table 3: Task parameters (D>T)
Page 8

Page 9
Figure 2: Transformation of priority order
Page 10
Table 4: Priority assignment algorithm efficiency improvement
Page 11

Page 12