ls3-www.cs.tu-dortmund.de/cms/medien/publikationen/EM-1996.pdf
Sequences:
I (1,1), (W), (3,3), (494) WA GQ, (3,319 (794) 1
{W), CW, (6,319 (7,411 {W), (W, C&3), (7,411 {(4,1), WA (6,3), (7,4)1
Fiaure 2
16
Proceedings of the 8th Euromicro Workshop on Real-Time Systems [...] wBs:=0; 3 j := I ; 4 while Tj = 0 A j I n do
/* search for the first non-empty set *I
5
6 7
5 j := j+l ; 6 endwhile 7 if j < n then I* non-empty set is found *I 8 WBS := Tj ; 9 for i := j+l to n do /* elementwise [...] & ) , one path for each task. I is no difficult to verify [S] that WCBTR(tO*pO)(t,,p,) .(t p ) z 7.. 7 “. ”
WCBTE(tO*jiO)(t,,&) ,.... (tn.&) where pi for i=l,...,n is the GO-path
associated to the reduced …