navigation
hledat
Toto je starší verze dokumentu!
Přednáška 2
Přepis bez minimalizace počtu registrů:
P1: X <- (A+B)*(A-B) ADD K,A,B SUB L,A,B MUL X,K,L P2: Y <- (C+D)/(C-D) ADD M,C,D SUB N,C,D DIV Y,M,N P3: Z <- X+Y ADD Z,X,Y P4: A <- E*F MUL A,E,F P5: Y <- E-Z SUB Y,E,Z P6: B <- (X-F)*A SUB O,X,F MUL B,O,A
Optimální průběh s minimem registrů:
| Time | ADD1 | ADD2 | MUL | DIV |
|---|---|---|---|---|
| 1 | ADD Y,C,D | SUB X,C,D | ||
| 2 | ADD X,A,B | SUB A,A,B | DIV Y,Y,X | |
| 3 | MUL X,X,A | = | ||
| 4 | = | = | ||
| 5 | = | = | ||
| 6 | SUB B,X,F | MUL A,E,F | = | |
| 7 | = | = | ||
| 8 | = | = | ||
| 9 | MUL B,B,A | = | ||
| 10 | = | = | ||
| 11 | = | = | ||
| 12 | = | |||
| 13 | = | |||
| 14 | = | |||
| 15 | = | |||
| 16 | = | |||
| 17 | = | |||
| 18 | = | |||
| 19 | = | |||
| 20 | ADD Z,X,Y | |||
| 21 | SUB Y,E,Z |
