Richard's Anomalies: USTC Increasing the number of processors C1=3① ⑨C=9 9 tasks with precedences and the shown execution times,where lower numbered tasks have higher C2=2② 8C8=4 priority than higher numbered tasks.Priority-based 3 processor schedule: C3=2③ ⑦C3=4 1 proc1 9 C4=24 6)C6=4 proc2 2 4 5 7 proc3 3 6 8 5 C5=4 time 0 4 6 8 10121416 .The priority-based proc1 8 schedule with four proc2 2 5 9 proc3 6 processors has a proc4 4 > longer execution time. time 0 6 8 10121416
Richard’s Anomalies: Increasing the number of processors 1 2 3 4 9 8 9 tasks with precedences and the shown execution times, where lower numbered tasks have higher priority than higher numbered tasks. Priority-based 3 processor schedule: 7 6 C1 = 3 C2 = 2 C3 = 2 C4 = 2 C9 = 9 C8 = 4 C7 = 4 C6 = 4 •The priority-based schedule with four processors has a longer execution time. 5 C5 = 4
Richard's Anomalies: Reducing computation times by 1 C1=2① 9)Cg=8 9 tasks with precedences and the shown execution times,where lower numbered tasks have higher C2=1② 8)C8=3 priority than higher numbered tasks.Priority-based 3 processor schedule: C3=13 ⑦C=3 1 proc1 9 C4=1(4 6 C6=3 proc2 2 × 5 7 proc3 3 6 8 5 C5=3 time 0 4 6 8 10121416 .Reducing the 5 8 computation times proc1 proc2 6 9 by 1 also results in 7 proc3 3 a longer execution time. time 6 8 10121416
Richard’s Anomalies: Reducing computation times by 1 1 2 3 4 9 8 9 tasks with precedences and the shown execution times, where lower numbered tasks have higher priority than higher numbered tasks. Priority-based 3 processor schedule: 7 6 C1 = 2 C2 = 1 C3 = 1 C4 = 1 C9 = 8 C8 = 3 C7 = 3 C6 = 3 •Reducing the computation times by 1 also results in a longer execution time. 5 C5 = 3
Richard's Anomalies: Weakening the precedence constraints C1=3① 9Cg=9 9 tasks with precedences and the shown execution times,where lower numbered tasks have higher C2=2② 8)C8=4 priority than higher numbered tasks.Priority-based 3 processor schedule: C3=23 ⑦C,=4 1 proc1 9 C4=24 6C6=4 proc2 2 × 5 7 proc3 3 6 8 5 C5=4 time 0 4 6 8 10121416 .Remove the 1 proc1 8 precedence proc2 2 4 5 constraints (4,8) proc3 6 and(4,7) time 4 6 8 10121416
Richard’s Anomalies: Weakening the precedence constraints 1 2 3 4 9 8 9 tasks with precedences and the shown execution times, where lower numbered tasks have higher priority than higher numbered tasks. Priority-based 3 processor schedule: 7 6 C1 = 3 C2 = 2 C3 = 2 C4 = 2 C9 = 9 C8 = 4 C7 = 4 C6 = 4 •Remove the precedence constraints (4,8) and (4,7) 5 C5 = 4