Exercices Architecture Des Ordinateurs

 

󰁅󰁘󰁅󰁒󰁃󰁉󰁃󰁅󰁓 󰁄󰀧󰁁󰁒󰁃󰁈󰁉󰁔󰁅󰁃󰁔󰁕󰁒󰁅 󰁄󰁅󰁓 󰁏󰁒󰁄󰁉󰁎󰁁󰁔󰁅󰁕󰁒󰁓 󰀱󰀸󰀯󰀱󰀰󰀯󰀲󰀰󰀱󰀰 󰁃󰁈󰁁󰁐󰁉󰁔󰁒󰁅󰁓 󰀱&󰀲

1 .   CONVERTION DANS D󲀙AUTRES BASES 󰃉󰁣󰁲󰁩󰁲󰁥 10110110󰀲 󰁥󰁮 󰁤󰃩󰁣󰁩󰁭󰁡󰁬. 󰃉󰁣󰁲󰁩󰁲󰁥 3456 󰁥󰁮 󰁢󰁩󰁮󰁡󰁩󰁲󰁥, 󰁰󰁵󰁩󰁳 󰁥󰁮 󰁨󰁥󰁸󰁡󰁤󰃩󰁣󰁩󰁭󰁡󰁬. 2 .   CODAGE EN COMPLEMENT A 2 S󰁵󰁲 8 󰁢󰁩󰁴󰁳, 󰁤󰁯󰁮󰁮󰁥󰁲 󰁬󰁥󰁳 󰁣󰁯󰁤󰁡󰁧󰁥󰁳 󰁥󰁮 󰁣󰁯󰁭󰁰󰁬󰃩󰁭󰁥󰁮󰁴 󰃠 2, 󰁬󰁯󰁲󰁳󰁱󰁵󰁥 󰁣󲀙󰁥󰁳󰁴 󰁰󰁯󰁳󰁳󰁩󰁢󰁬󰁥, 󰁤󰁥󰁳 󰁮󰁯󰁭󰁢󰁲󰁥󰁳 󰁳󰁵󰁩󰁶󰁡󰁮󰁴󰁳 : 0, 󰀭1, +10, 󰀭10, +64, 󰀭64, +127, 󰀭127, +200 3 .   ARITHMETIQUE BINAIRE S󰁵󰁲 8 󰁢󰁩󰁴󰁳, 󰁥󰁦󰁦󰁥󰁣󰁴󰁵󰁥󰁲 󰁬󰁡 󰁳󰁯󰁭󰁭󰁥 󰁥󰁮 󰁢󰁩󰁮󰁡󰁩󰁲󰁥 : 1011 01012 + 1100 00112 󰁥󰁴 󰁩󰁮󰁴󰁥󰁲󰁰󰁲󰃩󰁴󰁥󰁲 󰁬󰁥 󰁲󰃩󰁳󰁵󰁬󰁴󰁡󰁴 󰁥󰁮 󰃩󰁣󰁲󰁩󰁴󰁵󰁲󰁥 󰁤󰃩󰁣󰁩󰁭󰁡󰁬󰁥, 󰁥󰁮 󰁡󰁲󰁩󰁴󰁨󰁭󰃩󰁴󰁩󰁱󰁵󰁥 󰁳󰁩󰁧󰁮󰃩󰁥 󰁥󰁴 󰁮󰁯󰁮 󰁳󰁩󰁧󰁮󰃩󰁥. I󰁮󰁤󰁩󰁱󰁵󰁥󰁲 󰁤󰁡󰁮󰁳 󰁣󰁨󰁡󰁱󰁵󰁥 󰁣󰁡󰁳 󰁳󲀙󰁩󰁬 󰁹 󰁡 󰁤󰃩󰁢󰁯󰁲󰁤󰁥󰁭󰁥󰁮󰁴. M󰃪󰁭󰁥 󰁱󰁵󰁥󰁳󰁴󰁩󰁯󰁮 󰁰󰁯󰁵󰁲 󰁬󰁡 󰁳󰁯󰁭󰁭󰁥 : 111 01012 + 1100 00112  1.   ALGEBRE DE BOOLE S󰁩󰁭󰁰󰁬󰁩󰁦󰁩󰁥󰁲 󰁬󲀙󰁥󰁸󰁰󰁲󰁥󰁳󰁳󰁩󰁯󰁮 󰁳󰁵󰁩󰁶󰁡󰁮󰁴󰁥, 󰁥󰁮 󰁵󰁴󰁩󰁬󰁩󰁳󰁡󰁮󰁴 󰁬󰁥󰁳 󰁴󰁨󰃩󰁯󰁲󰃨󰁭󰁥󰁳 󰁤󰁥 󰁬󲀙󰁡󰁬󰁧󰃨󰁢󰁲󰁥 󰁤󰁥 B󰁯󰁯󰁬󰁥 : A*/B*C + A*/C*D + A*C + /D 4 .   ALGEBRE DE BOOLE : QUINE MC CLUSKEY S󰁩󰁭󰁰󰁬󰁩󰁦󰁩󰁥󰁲 󰁬󲀙󰁥󰁸󰁰󰁲󰁥󰁳󰁳󰁩󰁯󰁮 󰁳󰁵󰁩󰁶󰁡󰁮󰁴󰁥, 󰁥󰁮 󰁵󰁴󰁩󰁬󰁩󰁳󰁡󰁮󰁴 󰁬󲀙󰁡󰁬󰁧󰁯󰁲󰁩󰁴󰁨󰁭󰁥 󰁤󰁥 Q󰁵󰁩󰁮󰁥 M󰁣C󰁬󰁵󰁳󰁫󰁥󰁹 :

󰀨󰀱󰀬 󰀨󰀱󰀬 󰀲󰀬󰀳󰀬 󰀵󰀬󰀷󰀬 󰀱󰀱󰀬󰀱󰀳󰀬 󰀱󰀬󰀱󰀳󰀬 󰀱󰀷 󰀱󰀷󰀬󰀬 󰀱󰀹 󰀱󰀹󰀬󰀬 󰀲󰀳 󰀲󰀳󰀬󰀬 󰀲󰀹 󰀲󰀹󰀬󰀬 󰀳󰀱 󰀳󰀱󰀩󰀩 5 .   ALGEBRE DE BOOLE : GLITCH T󰁲󰁯󰁵󰁶󰁥󰁺 󰁴󰁯󰁵󰁳 󰁬󰁥󰁳 󰁧󰁬󰁩󰁴󰁣󰁨󰁥󰁳 󰁱󰁵󰁥 󰁰󰁥󰁵󰁴 󰁰󰁲󰃩󰁳󰁥󰁮󰁴󰁥󰁲 󰁬󲀙󰁥󰁸󰁰󰁲󰁥󰁳󰁳󰁩󰁯󰁮 󰁳󰁵󰁩󰁶󰁡󰁮󰁴󰁥 :

 󰀽     󰀫    󰀫     P󰁲󰁯󰁰󰁯󰁳󰁥󰁺 󰁵󰁮󰁥 󰁥󰁸󰁰󰁲󰁥󰁳󰁳󰁩󰁯󰁮 󰁭󰁯󰁤󰁩󰁦󰁩󰃩󰁥 󰁱󰁵󰁩 󰁳󰁵󰁰󰁰󰁲󰁩󰁭󰁥 󰁴󰁯󰁵󰁳 󰁣󰁥󰁳 󰁧󰁬󰁩󰁴󰁣󰁨󰁥󰁳. 6 .   ALGEBRE DE BOOLE P󰁲󰁯󰁵󰁶󰁥󰁲 󰁡󰁬󰁧󰃩󰁢󰁲󰁩󰁱󰁵󰁥󰁭󰁥󰁮󰁴 󰁱󰁵󰁥 󰁬󰁥 󰁳󰁣󰁨󰃩󰁭󰁡 󰁳󰁵󰁩󰁶󰁡󰁮󰁴 󰁥󰁳󰁴 󰁵󰁮 󰁡󰁤󰁤󰁩󰁴󰁩󰁯󰁮󰁮󰁥󰁵󰁲 󰁣󰁯󰁭󰁰󰁬󰁥󰁴 :

 

  7 .   ALGEBRE DE BOOLE R󰃩󰃩󰁣󰁲󰁩󰁲󰁥 󰁬󲀙󰁥󰁸󰁰󰁲󰁥󰁳󰁳󰁩󰁯󰁮 󰁳󰁵󰁩󰁶󰁡󰁮󰁴󰁥, 󰁵󰁮󰁩󰁱󰁵󰁥󰁭󰁥󰁮󰁴 󰁡󰁶󰁥󰁣 󰁬󲀙󰁯󰁰󰃩󰁲󰁡󰁴󰁥󰁵󰁲 󰁣󰁯󰁭󰁰󰁬󰁥󰁴 NAND : XOR(A,B) 8 .   CIRCUIT COMBINATOIRE : SYNTHESE PAR TABLE DE VERITE O󰁮 󰁳󰁯󰁵󰁨󰁡󰁩󰁴󰁥 󰁣󰁯󰁮󰁣󰁥󰁶󰁯󰁩󰁲 󰁵󰁮 󰁣󰁩󰁲󰁣󰁵󰁩󰁴 󰁣󰁯󰁭󰁢󰁩󰁮󰁡󰁴󰁯󰁩󰁲󰁥 󰁱󰁵󰁩 󰁣󰁡󰁬󰁣󰁵󰁬󰁥 󰁬󰁡 󰁶󰁡󰁬󰁥󰁵󰁲 󰁡󰁢󰁳󰁯󰁬󰁵󰁥 󰁥󰁮 󰁢󰁩󰁮󰁡󰁩󰁲󰁥 󰁰󰁵󰁲 󰁳󰁵󰁲 4 󰁢󰁩󰁴󰁳 󰁸,󰁹,󰁺,󰁴 󰁤󲀙󰁵󰁮 󰁮󰁯󰁭󰁢󰁲󰁥 󰁣󰁯󰁤󰃩 󰁥󰁮 󰁣󰁯󰁭󰁰󰁬󰃩󰁭󰁥󰁮󰁴 󰃠 2 󰁳󰁵󰁲 4 󰁢󰁩󰁴󰁳, 󰁡,󰁢,󰁣,󰁤. D󰁯󰁮󰁮󰁥󰁲 󰁬󰁡 󰁴󰁡󰁢󰁬󰁥 󰁤󰁥 󰁶󰃩󰁲󰁩󰁴󰃩 󰁤󰁥 󰁣󰁥 󰁣󰁩󰁲󰁣󰁵󰁩󰁴 󰁣󰁯󰁭󰁢󰁩󰁮󰁡󰁴󰁯󰁩󰁲󰁥, 󰁰󰁵󰁩󰁳 󰁦󰁯󰁵󰁲󰁮󰁩󰁲 󰁬󰁥󰁳 󰃩󰁱󰁵󰁡󰁴󰁩󰁯󰁮󰁳 󰁤󰁥 󰁡,󰁢,󰁣,󰁤 󰁥󰁮 󰁦󰁯󰁮󰁣󰁴󰁩󰁯󰁮 󰁤󰁥 󰁸,󰁹,󰁺,󰁴 󰁥󰁮 󰁬󰁥󰁳 󰁳󰁩󰁭󰁰󰁬󰁩󰁦󰁩󰁡󰁮󰁴 󰁡󰁵 󰁢󰁥󰁳󰁯󰁩󰁮 󰃠 󰁬󲀙󰁡󰁩󰁤󰁥 󰁤󰁥 󰁴󰁡󰁢󰁬󰁥󰁳 󰁤󰁥 K󰁡󰁮󰁡󰁵󰁧󰁨. 9 .   CIRCUIT COMBINATOIRE : SYNTHESE FONCTIONNELLE O󰁮 󰁳󰁯󰁵󰁨󰁡󰁩󰁴󰁥 󰁣󰁯󰁮󰁣󰁥󰁶󰁯󰁩󰁲 󰁵󰁮 󰁣󰁩󰁲󰁣󰁵󰁩󰁴 󰁣󰁯󰁭󰁢󰁩󰁮󰁡󰁴󰁯󰁩󰁲󰁥 󰁱󰁵󰁩 󰁣󰁯󰁭󰁭󰁡󰁮󰁤󰁥 󰁬󲀙󰁯󰁵󰁶󰁥󰁲󰁴󰁵󰁲󰁥 󰁤󲀙󰁵󰁮󰁥 󰁰󰁯󰁲󰁴󰁥 󰁤󰁥 󰁪󰁡󰁲󰁤󰁩󰁮 󰁰󰁵󰁢󰁬󰁩󰁱󰁵󰁥, 󰁯󰁵󰁶󰁥󰁲󰁴󰁥 󰁥󰁮 󰁨󰁩󰁶󰁥󰁲 󰁤󰁥 10󰁨 󰃠 18󰁨 󰁥󰁴 󰁥󰁮 󰃩󰁴󰃩 󰁤󰁥 8󰁨 󰃠 20󰁨. L󲀙󰁨󰁥󰁵󰁲󰁥 󰁥󰁳󰁴 󰁣󰁯󰁤󰃩󰁥 󰁳󰁵󰁲 5 󰁢󰁩󰁴󰁳, 󰁳󰁯󰁵󰁳 󰁦󰁯󰁲󰁭󰁥 󰁤󲀙󰁵󰁮 󰁮󰁯󰁭󰁢󰁲󰁥 󰁥󰁮󰁴󰁩󰁥󰁲 H 󰁣󰁯󰁭󰁰󰁲󰁩󰁳 󰁥󰁮󰁴󰁲󰁥 0 󰁥󰁴 23 ; 󰁬󰁡 󰁳󰁡󰁩󰁳󰁯󰁮 󰁥󰁳󰁴 󰁣󰁯󰁤󰃩󰁥 󰁳󰁯󰁵󰁳 󰁦󰁯󰁲󰁭󰁥 󰁤󲀙󰁵󰁮 󰁳󰁩󰁧󰁮󰁡󰁬 S (0=󰁨󰁩󰁶󰁥󰁲, 1=󰃩󰁴󰃩). C󰁯󰁮󰁣󰁥󰁶󰁯󰁩󰁲 󰁵󰁮 󰁣󰁩󰁲󰁣󰁵󰁩󰁴 󰁤󲀙󰁩󰁮󰁴󰁥󰁲󰁦󰁡󰁣󰁥 PORTE(H[4..0], S : M) 󰁴󰁥󰁬 󰁱󰁵󰁥 M=1 󰁳󰁩 󰁥󰁴 󰁳󰁥󰁵󰁬󰁥󰁭󰁥󰁮󰁴 󰁳󰁩 : 󰀭 

S = 0 󰁥󰁴 10 ≤ H ≤ 18, 󰁯󰁵

󰀭 

S = 1 󰁥󰁴 8 ≤ H ≤ 20

O󰁮 󰁣󰁯󰁮󰁣󰁥󰁶󰁲󰁡 󰁬󰁥 󰁣󰁩󰁲󰁣󰁵󰁩󰁴 󰁤󰁥 󰁦󰁡󰃧󰁯󰁮 󰁦󰁯󰁮󰁣󰁴󰁩󰁯󰁮󰁮󰁥󰁬󰁬󰁥, 󰁥󰁮 󰁣󰁯󰁭󰁢󰁩󰁮󰁡󰁮󰁴 󰁵󰁮󰁩󰁱󰁵󰁥󰁭󰁥󰁮󰁴 : 󰀭 

2 󰁣󰁯󰁭󰁰󰁡󰁲󰁡󰁴󰁥󰁵󰁲󰁳 󰁮󰁯󰁮 󰁳󰁩󰁧󰁮󰃩󰁳 󰁳󰁵󰁲 5 󰁢󰁩󰁴󰁳

󰀭 

2 󰁭󰁵󰁬󰁴󰁩󰁰󰁬󰁥󰁸󰁥󰁵󰁲󰁳 2 :1 󰁯󰁰󰃩󰁲󰁡󰁮󰁴 󰁳󰁵󰁲 󰁤󰁥󰁳 󰁢󰁵󰁳 󰁤󰁥 5 󰁢󰁩󰁴󰁳

󰀭 

󰁵󰁮󰁥 󰁰󰁯󰁲󰁴󰁥 ET 󰃠 󰁤󰁥󰁵󰁸 󰁥󰁮󰁴󰁲󰃩󰁥󰁳

1 0 .   CIRCUIT COMBINATOIRE : CONCEPTION MODULAIRE C󰁯󰁮󰁳󰁴󰁲󰁵󰁩󰁲󰁥 󰁵󰁮 󰁥󰁮󰁣󰁯󰁤󰁥󰁵󰁲 󰁤󰁥 󰁰󰁲󰁩󰁯󰁲󰁩󰁴󰃩 󰃠 8 󰁥󰁮󰁴󰁲󰃩󰁥󰁳 󰁡󰁶󰁥󰁣 2 󰁥󰁮󰁣󰁯󰁤󰁥󰁵󰁲󰁳 󰁤󰁥 󰁰󰁲󰁩󰁯󰁲󰁩󰁴󰃩 󰃠 4 󰁥󰁮󰁴󰁲󰃩󰁥󰁳. L󰁥󰁳 󰁣󰁩󰁲󰁣󰁵󰁩󰁴󰁳 󰁯󰁮󰁴 󰁬󲀙󰁩󰁮󰁴󰁥󰁲󰁦󰁡󰁣󰁥 : prioencoder4(e[3..0] : num[1..0], act) prioencoder8(e[7..0] : num[2..0], act)

1 1 .   CIRCUIT COMBINATOIRE : CONCEPTION MODULAIRE

 

C󰁯󰁮󰁳󰁴󰁲󰁵󰁩󰁲󰁥 󰁵󰁮 󰁭󰁵󰁬󰁴󰁩󰁰󰁬󰁥󰁸󰁥󰁵󰁲 8 :1 󰁡󰁶󰁥󰁣 2 󰁭󰁵󰁬󰁴󰁩󰁰󰁬󰁥󰁸󰁥󰁵󰁲󰁳 4 :1 󰁥󰁴 󰁵󰁮 󰁭󰁵󰁬󰁴󰁩󰁰󰁬󰁥󰁸󰁥󰁵󰁲 2 :1 1 2 .   MEMOIRES A󰁳󰁳󰁯󰁣󰁩󰁥󰁲 4 󰁭󰁯󰁤󰁵󰁬󰁥󰁳 󰁭󰃩󰁭󰁯󰁩󰁲󰁥󰁳 󰁤󰁥 4K 󰁭󰁯󰁴󰁳 󰁤󰁥 4 󰁢󰁩󰁴󰁳, 󰁤󲀙󰁩󰁮󰁴󰁥󰁲󰁦󰁡󰁣󰁥 mem4Kx4(addr[11..0], W, CE, OE : data[3..0]) 󰁰󰁯󰁵󰁲 󰁦󰁯󰁲󰁭󰁥󰁲 󰁵󰁮 󰁭󰁯󰁤󰁵󰁬󰁥 󰁤󰁥 16K 󰁭󰁯󰁴󰁳 󰁤󰁥 4 󰁢󰁩󰁴󰁳.

󰁃󰁈󰁁󰁐󰁉󰁔󰁒󰁅󰁓 󰀳&󰀴

1 3 .   CIRCUIT SEQUENTIEL AVEC GRAPHE D󲀙ETATS C󰁯󰁮󰁣󰁥󰁶󰁯󰁩󰁲 󰁵󰁮 󰁣󰁩󰁲󰁣󰁵󰁩󰁴 󰁳󰃩󰁱󰁵󰁥󰁮󰁴󰁩󰁥󰁬 󰁳󰁹󰁮󰁣󰁨󰁲󰁯󰁮󰁥 󰁤󲀙󰁩󰁮󰁴󰁥󰁲󰁦󰁡󰁣󰁥 croissant(rst, clk, a[1..0] : up) 󰁴󰁥󰁬 󰁱󰁵󰁥 󰁵󰁰=1 󰁳󰁩 󰁥󰁴 󰁳󰁥󰁵󰁬󰁥󰁭󰁥󰁮󰁴 󰁳󰁩 󰁬󰁡 󰁶󰁡󰁬󰁥󰁵󰁲 󰁤󰁥 󰁡[1..0󰁝 󰁡󰁵 󰁦󰁲󰁯󰁮󰁴 󰁤󲀙󰁨󰁯󰁲󰁬󰁯󰁧󰁥 󰁥󰁳󰁴 󰁰󰁬󰁵󰁳 󰁧󰁲󰁡󰁮󰁤󰁥 󰁯󰁵 󰃩󰁧󰁡󰁬󰁥 (󰁣󰁯󰁭󰁰󰁡󰁲󰁡󰁩󰁳󰁯󰁮 󰁮󰁯󰁮 󰁳󰁩󰁧󰁮󰃩󰁥) 󰃠 󰁬󰁡 󰁶󰁡󰁬󰁥󰁵󰁲 󰁤󰁥 󰁡[1..0󰁝 󰁡󰁵 󰁦󰁲󰁯󰁮󰁴 󰁤󲀙󰁨󰁯󰁲󰁬󰁯󰁧󰁥 󰁰󰁲󰃩󰁣󰃩󰁤󰁥󰁮󰁴 (= 󰁳󰁩 󰁡[1..0󰁝 󰁣󰁲󰁯󰁩󰁴 󰁯󰁵 󰁲󰁥󰁳󰁴󰁥 󰁳󰁴󰁡󰁢󰁬󰁥). 󰀭 

󰁤󰁥󰁳󰁳󰁩󰁮󰁥󰁲 󰁬󰁥 󰁧󰁲󰁡󰁰󰁨󰁥 󰁤󰁥 MEALY 󰁤󰁥 󰁣󰁥 󰁣󰁩󰁲󰁣󰁵󰁩󰁴

󰀭 

󰁳󰁹󰁮󰁴󰁨󰃩󰁴󰁩󰁳󰁥󰁲 󰁬󰁥 󰁣󰁩󰁲󰁣󰁵󰁩󰁴 󰁡󰁶󰁥󰁣 󰁤󰁥󰁳 󰁢󰁡󰁳󰁣󰁵󰁬󰁥󰁳 D

1 4 .   CIRCUIT SEQUENTIEL : CONCEPTION FONCTIONNELLE C󰁯󰁮󰁣󰁥󰁶󰁯󰁩󰁲 󰁤󰁥 󰁦󰁡󰃧󰁯󰁮 󰁦󰁯󰁮󰁣󰁴󰁩󰁯󰁮󰁮󰁥󰁬󰁬󰁥 󰁵󰁮 󰁣󰁩󰁲󰁣󰁵󰁩󰁴 󰁡󰁮󰁡󰁬󰁯󰁧󰁵󰁥 󰁡󰁵 󰁰󰁲󰃩󰁣󰃩󰁤󰁥󰁮󰁴 󰁯󰁰󰃩󰁲󰁡󰁮󰁴 󰁳󰁵󰁲 󰁤󰁥󰁳 󰁮󰁯󰁭󰁢󰁲󰁥󰁳 󰁤󰁥 4 󰁢󰁩󰁴󰁳 󰁡󰁶󰁥󰁣 󰁵󰁮 󰁲󰁥󰁧󰁩󰁳󰁴󰁲󰁥 4 󰁢󰁩󰁴󰁳 󰁥󰁴 󰁵󰁮 󰁣󰁯󰁭󰁰󰁡󰁲󰁡󰁴󰁥󰁵󰁲 󰁮󰁯󰁮 󰁳󰁩󰁧󰁮󰃩 󰁳󰁵󰁲 4 󰁢󰁩󰁴󰁳. 1 5 .   CIRCUIT SEQUENTIEL D󰁥󰁳󰁳󰁩󰁮󰁥󰁲 󰁬󰁥 󰁧󰁲󰁡󰁰󰁨󰁥 󰁤󰁥 MOORE 󰁤󲀙󰁵󰁮 󰁣󰁩󰁲󰁣󰁵󰁩󰁴 󰁳󰃩󰁱󰁵󰁥󰁮󰁴󰁩󰁥󰁬 󰁱󰁵󰁩 󰁤󰃩󰁴󰁥󰁣󰁴󰁥 󰁬󰁡 󰁳󰃩󰁱󰁵󰁥󰁮󰁣󰁥 1,1 ; 󰁣󰁯󰁮󰁣󰁥󰁶󰁯󰁩󰁲 󰁣󰁥 󰁣󰁩󰁲󰁣󰁵󰁩󰁴 󰃠 󰁬󲀙󰁡󰁩󰁤󰁥 󰁤󲀙󰁵󰁮 󰁲󰁥󰁧󰁩󰁳󰁴󰁲󰁥 󰃠 󰁤󰃩󰁣󰁡󰁬󰁡󰁧󰁥 󰁤󰁥 2 󰁢󰁩󰁴󰁳. T󰁲󰁡󰁮󰁳󰁦󰁯󰁲󰁭󰁥󰁲 󰁬󰁥 󰁧󰁲󰁡󰁰󰁨󰁥 󰁤󰁥 MOORE 󰁥󰁮 󰁧󰁲󰁡󰁰󰁨󰁥 󰁤󰁥 MEALY, 󰁰󰁵󰁩󰁳 󰁣󰁯󰁮󰁣󰁥󰁶󰁯󰁩󰁲 󰁬󰁥 󰁣󰁩󰁲󰁣󰁵󰁩󰁴 󰁣󰁯󰁲󰁲󰁥󰁳󰁰󰁯󰁮󰁤󰁡󰁮󰁴. E󰁮 󰁳󲀙󰁩󰁮󰁳󰁰󰁩󰁲󰁡󰁮󰁴 󰁤󰁵 󰁲󰃩󰁳󰁵󰁬󰁴󰁡󰁴 󰁯󰁢󰁴󰁥󰁮󰁵, 󰁰󰁲󰁯󰁤󰁵󰁩󰁲󰁥 󰁵󰁮 󰁣󰁩󰁲󰁣󰁵󰁩󰁴 󰁤󰁥 MEALY 󰁱󰁵󰁩 󰁤󰃩󰁴󰁥󰁣󰁴󰁥 󰁬󰁡 󰁳󰃩󰁱󰁵󰁥󰁮󰁣󰁥 1,0,1. 1 6 .   MODIFICATION D󲀙UN COMPTEUR M󰁯󰁤󰁩󰁦󰁩󰁥󰁲 󰁵󰁮 󰁣󰁯󰁭󰁰󰁴󰁥󰁵󰁲 󰁤󰁥 J󰁯󰁨󰁮󰁳󰁯󰁮 󰃠 3 󰃩󰁴󰁡󰁴󰁳 󰁰󰁯󰁵󰁲 󰁱󰁵󲀙󰁩󰁬 󰁮󰁥 󰁣󰁯󰁭󰁰󰁴󰁥 󰁱󰁵󰁥 󰁳󰁵󰁲 5 󰃩󰁴󰁡󰁴󰁳, 󰁥󰁮 󰁰󰁡󰁳󰁳󰁡󰁮󰁴 󰁤󰁥 001 󰃠 000. 1 7 .   MODIFICATION D󲀙UN COMPTEUR C󰁯󰁮󰁣󰁥󰁶󰁯󰁩󰁲 󰁥󰁴 󰁤󰁯󰁮󰁮󰁥󰁲 󰁬󰁥 󰁣󰁯󰁤󰁥 MDL 󰁤󲀙󰁵󰁮 󰁣󰁯󰁭󰁰󰁴󰁥󰁵󰁲󰀭󰁤󰃩󰁣󰁯󰁭󰁰󰁴󰁥󰁵󰁲 󰁳󰁵󰁲 4 󰁢󰁩󰁴󰁳, 󰁱󰁵󰁩 󰁣󰁯󰁭󰁰󰁴󰁥 󰁳󰁥󰁬󰁯󰁮 󰁬󰁡 󰁳󰃩󰁱󰁵󰁥󰁮󰁣󰁥 0, 1, 󲀦, 14, 15, 14,󲀦, 2, 1, 0, 1,󲀦 O󰁮 󰁰󰁲󰁯󰁤󰁵󰁩󰁲󰁡 󰁡󰁵󰁳󰁳󰁩 󰁥󰁮 󰁳󰁯󰁲󰁴󰁩󰁥 󰁵󰁮 󰁳󰁩󰁧󰁮󰁡󰁬 down 󰁱󰁵󰁩 󰁩󰁮󰁤󰁩󰁱󰁵󰁥 󰁳󰁩 󰁬󰁥 󰁣󰁯󰁭󰁰󰁴󰁥󰁵󰁲 󰁥󰁳󰁴 󰁥󰁮 󰁰󰁨󰁡󰁳󰁥 󰁤󰁥󰁳󰁣󰁥󰁮󰁤󰁡󰁮󰁴󰁥 (=1) 󰁯󰁵 󰁡󰁳󰁣󰁥󰁮󰁤󰁡󰁮󰁴󰁥 (=0). 1 8 .   COMPTEUR AVEC INITIALISATION C󰁯󰁮󰁣󰁥󰁶󰁯󰁩󰁲 󰁵󰁮 󰁣󰁯󰁭󰁰󰁴󰁥󰁵󰁲 4 󰁢󰁩󰁴󰁳 󰁳󰁹󰁮󰁣󰁨󰁲󰁯󰁮󰁥 󰁤󲀙󰁩󰁮󰁴󰁥󰁲󰁦󰁡󰁣󰁥 cpt4ini(rst, clk, load, ini[3..0] : s[3..0]) 󰁴󰁥󰁬 󰁱󰁵󰁥, 󰁬󰁯󰁲󰁳󰁱󰁵󰁥 󰁬󰁯󰁡󰁤 = 0 󰁩󰁬 󰁣󰁯󰁭󰁰󰁴󰁥 󰁮󰁯󰁲󰁭󰁡󰁬󰁥󰁭󰁥󰁮󰁴, 󰁥󰁴 󰁬󰁯󰁲󰁳󰁱󰁵󰁥 󰁬󰁯󰁡󰁤=1 󰁬󰁡 󰁶󰁡󰁬󰁥󰁵󰁲 󰁤󰁵 󰁣󰁯󰁭󰁰󰁴󰁥󰁵󰁲 󰁥󰁳󰁴 󰁩󰁮󰁩󰁴󰁩󰁡󰁬󰁩󰁳󰃩󰁥 󰁡󰁶󰁥󰁣 󰁩󰁮󰁩[3..0󰁝 󰁡󰁵 󰁦󰁲󰁯󰁮󰁴 󰁤󲀙󰁨󰁯󰁲󰁬󰁯󰁧󰁥.

 

󰁃󰁈󰁁󰁐󰁉󰁔󰁒󰁅󰁓 󰀵

1 9 .   AJOUT D'UNE NOUVELLE INSTRUCTION O󰁮 󰁤󰁩󰁳󰁰󰁯󰁳󰁥 󰁤󲀙󰁵󰁮 󰁤󰃩󰁣󰁡󰁬󰁥󰁵󰁲 󰃠 󰁢󰁡󰁲󰁩󰁬󰁬󰁥󰁴 󰁤󰁥 32 󰁢󰁩󰁴󰁳, 󰁤󲀙󰁩󰁮󰁴󰁥󰁲󰁦󰁡󰁣󰁥 : module barrelshifter32(r, nb[4..0], e[31..0] : s[31..0])

D󰃩󰁣󰁲󰁩󰁲󰁥 󰁣󰁯󰁭󰁭󰁥󰁮󰁴 󰁬󲀙󰁩󰁮󰁴󰃩󰁧󰁲󰁥󰁲 󰃠 CRAPS 󰁥󰁴 󰁡󰁪󰁯󰁵󰁴󰁥󰁲 󰁬󰁥󰁳 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮󰁳 󰁳󰁬󰁲 󰁥󰁴 󰁳󰁬󰁬. 2 0 .   AJOUT D'UNE NOUVELLE INSTRUCTION O󰁮 󰁳󰁯󰁵󰁨󰁡󰁩󰁴󰁥 󰁡󰁪󰁯󰁵󰁴󰁥󰁲 󰃠 CRAPS 󰁵󰁮󰁥 󰁮󰁯󰁵󰁶󰁥󰁬󰁬󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 (󰁥󰁴 NON 󰁵󰁮󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 󰁳󰁹󰁮󰁴󰁨󰃩󰁴󰁩󰁱󰁵󰁥), 󰁤'󰃩󰁣󰁲󰁩󰁴󰁵󰁲󰁥 󰁡󰁳󰁳󰁥󰁭󰁢󰁬󰁥󰁵󰁲 : swap %r, %r

C󰁥󰁴󰁴󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 󰁤󰁯󰁩󰁴 󰁰󰁥󰁲󰁭󰁵󰁴󰁥󰁲 󰁬󰁥 󰁣󰁯󰁮󰁴󰁥󰁮󰁵 󰁤󰁥 %󰁲 󰁥󰁴 %󰁲, 󰁳󰁡󰁮󰁳 󰁭󰁯󰁤󰁩󰁦󰁩󰁥󰁲 󰁡󰁵󰁣󰁵󰁮 󰁡󰁵󰁴󰁲󰁥 󰁲󰁥󰁧󰁩󰁳󰁴󰁲󰁥. P󰁲󰁯󰁰󰁯󰁳󰁥󰁲 󰁵󰁮 󰁮󰁯󰁵󰁶󰁥󰁡󰁵 󰁣󰁯󰁤󰁥 󰁭󰁡󰁣󰁨󰁩󰁮󰁥 󰁰󰁯󰁵󰁲 󰁣󰁥󰁴󰁴󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮, 󰁤󰁡󰁮󰁳 󰁬󰁥 󰁧󰁲󰁯󰁵󰁰󰁥 󰁤󰁥󰁳 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮󰁳 󰁤󰁥 󰁣󰁡󰁬󰁣󰁵󰁬, 󰁥󰁴 󰁤󰃩󰁣󰁲󰁩󰁲󰁥 󰁴󰁯󰁵󰁴󰁥󰁳 󰁬󰁥󰁳 󰁭󰁯󰁤󰁩󰁦󰁩󰁣󰁡󰁴󰁩󰁯󰁮󰁳 󰃠 󰁥󰁦󰁦󰁥󰁣󰁴󰁵󰁥󰁲 󰁰󰁯󰁵󰁲 󰁬󲀙󰁩󰁭󰁰󰁬󰃩󰁭󰁥󰁮󰁴󰁥󰁲. 2 1 .   AJOUT D'UNE NOUVELLE INSTRUCTION O󰁮 󰁳󰁯󰁵󰁨󰁡󰁩󰁴󰁥 󰁡󰁪󰁯󰁵󰁴󰁥󰁲 󰃠 CRAPS 󰁵󰁮󰁥 󰁮󰁯󰁵󰁶󰁥󰁬󰁬󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 (󰁥󰁴 NON 󰁵󰁮󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 󰁳󰁹󰁮󰁴󰁨󰃩󰁴󰁩󰁱󰁵󰁥), 󰁤'󰃩󰁣󰁲󰁩󰁴󰁵󰁲󰁥 󰁡󰁳󰁳󰁥󰁭󰁢󰁬󰁥󰁵󰁲 : greatest %rs1, %rs2, %rd

C󰁥󰁴󰁴󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 󰁣󰁯󰁰󰁩󰁥 󰁤󰁡󰁮󰁳 %󰁲󰁤 󰁬󰁡 󰁰󰁬󰁵󰁳 󰁧󰁲󰁡󰁮󰁤󰁥 󰁤󰁥󰁳 󰁤󰁥󰁵󰁸 󰁶󰁡󰁬󰁥󰁵󰁲󰁳 󰁤󰁥󰁳 󰁲󰁥󰁧󰁩󰁳󰁴󰁲󰁥󰁳 %󰁲󰁳1 󰁯󰁵 %󰁲󰁳2, 󰁣󰁯󰁮󰁳󰁩󰁤󰃩󰁲󰃩󰁥󰁳 󰁣󰁯󰁭󰁭󰁥 󰁳󰁩󰁧󰁮󰃩󰁥󰁳. P󰁲󰁯󰁰󰁯󰁳󰁥󰁲 󰁵󰁮 󰁮󰁯󰁵󰁶󰁥󰁡󰁵 󰁣󰁯󰁤󰁥 󰁭󰁡󰁣󰁨󰁩󰁮󰁥 󰁰󰁯󰁵󰁲 󰁣󰁥󰁴󰁴󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮, 󰁤󰁡󰁮󰁳 󰁬󰁥 󰁧󰁲󰁯󰁵󰁰󰁥 󰁤󰁥󰁳 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮󰁳 󰁤󰁥 󰁣󰁡󰁬󰁣󰁵󰁬, 󰁥󰁴 󰁤󰃩󰁣󰁲󰁩󰁲󰁥 󰁴󰁯󰁵󰁴󰁥󰁳 󰁬󰁥󰁳 󰁭󰁯󰁤󰁩󰁦󰁩󰁣󰁡󰁴󰁩󰁯󰁮󰁳 󰃠 󰁥󰁦󰁦󰁥󰁣󰁴󰁵󰁥󰁲 󰁰󰁯󰁵󰁲 󰁬󲀙󰁩󰁭󰁰󰁬󰃩󰁭󰁥󰁮󰁴󰁥󰁲. 2 2 .   AJOUT D'UNE NOUVELLE INSTRUCTION O󰁮 󰁳󰁯󰁵󰁨󰁡󰁩󰁴󰁥 󰁡󰁪󰁯󰁵󰁴󰁥󰁲 󰃠 CRAPS 󰁵󰁮󰁥 󰁮󰁯󰁵󰁶󰁥󰁬󰁬󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 (󰁥󰁴 NON 󰁵󰁮󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 󰁳󰁹󰁮󰁴󰁨󰃩󰁴󰁩󰁱󰁵󰁥), 󰁤'󰃩󰁣󰁲󰁩󰁴󰁵󰁲󰁥 󰁡󰁳󰁳󰁥󰁭󰁢󰁬󰁥󰁵󰁲 : ld4 [%r+4*%r], %r

C󰁥󰁴󰁴󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 󰁣󰁯󰁰󰁩󰁥 󰁤󰁡󰁮󰁳 %󰁲 󰁬󰁥 󰁭󰁯󰁴 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰁳󰁩󰁴󰁵󰃩 󰃠 󰁬󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁥 󰁯󰁢󰁴󰁥󰁮󰁵󰁥 󰁰󰁡󰁲 󰁬󰁥 󰁣󰁡󰁬󰁣󰁵󰁬 %󰁲+4*%󰁲. E󰁬󰁬󰁥 󰁰󰁥󰁲󰁭󰁥󰁴 󰁡󰁩󰁮󰁳󰁩 󰁤󰁥 󰁬󰁩󰁲󰁥 󰁤󰁩󰁲󰁥󰁣󰁴󰁥󰁭󰁥󰁮󰁴 󰁬󲀙󰃩󰁬󰃩󰁭󰁥󰁮󰁴 󰁤󲀙󰁩󰁮󰁤󰁩󰁣󰁥 %󰁲 󰁤󲀙󰁵󰁮 󰁴󰁡󰁢󰁬󰁥󰁡󰁵 󰁤󰁥 󰁭󰁯󰁴󰁳 󰁤󰁥 32 󰁢󰁩󰁴󰁳 󰁣󰁯󰁮󰁳󰃩󰁣󰁵󰁴󰁩󰁦󰁳 󰁳󰁩󰁴󰁵󰃩 󰃠 󰁬󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁥 %󰁲. P󰁲󰁯󰁰󰁯󰁳󰁥󰁲 󰁵󰁮 󰁮󰁯󰁵󰁶󰁥󰁡󰁵 󰁣󰁯󰁤󰁥 󰁭󰁡󰁣󰁨󰁩󰁮󰁥 󰁰󰁯󰁵󰁲 󰁣󰁥󰁴󰁴󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮, 󰁤󰁡󰁮󰁳 󰁬󰁥 󰁧󰁲󰁯󰁵󰁰󰁥 󰁤󰁥󰁳 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮󰁳 󰁤󲀙󰁡󰁣󰁣󰃨󰁳 󰁭󰃩󰁭󰁯󰁩󰁲󰁥, 󰁥󰁴 󰁤󰃩󰁣󰁲󰁩󰁲󰁥 󰁴󰁯󰁵󰁴󰁥󰁳 󰁬󰁥󰁳 󰁭󰁯󰁤󰁩󰁦󰁩󰁣󰁡󰁴󰁩󰁯󰁮󰁳 󰃠 󰁥󰁦󰁦󰁥󰁣󰁴󰁵󰁥󰁲 󰁰󰁯󰁵󰁲 󰁬󲀙󰁩󰁭󰁰󰁬󰃩󰁭󰁥󰁮󰁴󰁥󰁲. 2 3 .   SEQUENCE DE MICROCOMMANDES ASSOCIEES A L'INSTRUCTION

 

C󰁯󰁭󰁰󰁬󰃩󰁴󰁥󰁲 󰁬󰁥 󰁴󰁡󰁢󰁬󰁥󰁡󰁵 󰁳󰁵󰁩󰁶󰁡󰁮󰁴 󰁡󰁶󰁥󰁣 󰁬󰁡 󰁳󰁵󰁩󰁴󰁥 󰁤󰁥󰁳 󰁭󰁩󰁣󰁲󰁯󰁣󰁯󰁭󰁭󰁡󰁮󰁤󰁥󰁳 󰃠 󰁥󰁮󰁶󰁯󰁹󰁥󰁲 󰁰󰁯󰁵󰁲 󰁥󰁸󰃩󰁣󰁵󰁴󰁥󰁲 󰁬'󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 : ld

󰁡󰁲󰁥󰁧

[%rs1+simm13 [%rs1+simm13], ], %rd

󰁢󰁲󰁥󰁧

󰁤󰁲󰁥󰁧

󰁣󰁭󰁤󰁟󰁵󰁡󰁬

󰁯󰁥󰁟󰁮󰁵󰁭

󰁷󰁲󰁩󰁴󰁥

󰁣󰁯󰁭󰁭󰁥󰁮󰁴󰁡󰁩󰁲󰁥

2 4 .   ACCELERATION DE L󲀙EXECUTION D󲀙UNE INSTRUCTION O󰁮 󰁳󰁯󰁵󰁨󰁡󰁩󰁴󰁥 󰁡󰁣󰁣󰃩󰁬󰃩󰁲󰁥󰁲 󰁬󰁥󰁳 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮󰁳 󰁤󰁥 󰁬󰁥󰁣󰁴󰁵󰁲󰁥 󰁥󰁮 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰁬󰁯󰁲󰁳󰁱󰁵󲀙󰁥󰁬󰁬󰁥󰁳 󰁯󰁮󰁴 󰁬󰁡 󰁦󰁯󰁲󰁭󰁥 󰁰󰁡󰁲󰁴󰁩󰁣󰁵󰁬󰁩󰃨󰁲󰁥 󰁳󰁵󰁩󰁶󰁡󰁮󰁴󰁥 (󰁲󰁥󰁧󰁩󰁳󰁴󰁲󰁥 󰁲󰁳2 󰁮󰁵󰁬): ld [%ri+%r0],%r [%ri+%r0],%rj j

(1)

%󰁲󰁩 󰁥󰁴 %󰁲󰁪 󰁳󰁯󰁮󰁴 󰁤󰁥󰁵󰁸 󰁲󰁥󰁧󰁩󰁳󰁴󰁲󰁥󰁳 󰁵󰁴󰁩󰁬󰁩󰁳󰁡󰁴󰁥󰁵󰁲󰁳 ; 󰁥󰁬󰁬󰁥 󰁥󰁳󰁴 󰁨󰁡󰁢󰁩󰁴󰁵󰁥󰁬󰁬󰁥󰁭󰁥󰁮󰁴 󰃩󰁣󰁲󰁩󰁴󰁥 ld [%ri],%rj  • 

󰁤󰁥󰁳󰁳󰁩󰁮󰁥󰁲 󰁬󰁥 󰁣󰁯󰁤󰁥 󰁭󰁡󰁣󰁨󰁩󰁮󰁥 󰁤󰁥 󰁣󰁥󰁴󰁴󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 (󰁬󰁥󰁳 󰁣󰁨󰁡󰁭󰁰󰁳 󰁩 󰁥󰁴 󰁪 󰁳󰁥󰁲󰁯󰁮󰁴 󰁩󰁮󰁤󰁩󰁱󰁵󰃩󰁳 󰁤󰁥 󰁦󰁡󰃧󰁯󰁮 󰁧󰃩󰁮󰃩󰁲󰁩󰁱󰁵󰁥)

• 

󰁤󰁥󰁳󰁳󰁩󰁮󰁥󰁲 󰁬󰁥 󰁳󰁯󰁵󰁳󰀭󰁧󰁲󰁡󰁰󰁨󰁥 󰁤󰁥 󰁳󰃩󰁱󰁵󰁥󰁮󰁣󰁥󰁭󰁥󰁮󰁴 󰁤󰁥󰁳 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮󰁳 󰁬󰁤 󰁡󰁶󰁥󰁣 2 󰃨󰁭󰁥 󰁯󰁰󰃩󰁲󰁡󰁮󰁤󰁥 󰁲󰁥󰁧󰁩󰁳󰁴󰁲󰁥, 󰁴󰁥󰁬 󰁱󰁵󲀙󰁩󰁬 󰁡 󰃩󰁴󰃩 󰁶󰁵 󰁥󰁮 TDTP

• 

󰁍󰁯󰁤󰁩󰁦󰁩󰁥󰁲 󰁣󰁥 󰁧󰁲󰁡󰁰󰁨󰁥 󰁰󰁯󰁵󰁲 󰁡󰁣󰁣󰃩󰁬󰃩󰁲󰁥󰁲 󰁬󰁥󰁳 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮󰁳 󰁤󰁵 󰁴󰁹󰁰󰁥 (1).

2 5 .   AJOUT D󲀙UN BOITIER MEMOIRE O󰁮 󰁳󰁯󰁵󰁨󰁡󰁩󰁴󰁥 󰁲󰁡󰁪󰁯󰁵󰁴󰁥󰁲 󰁵󰁮 󰁢󰁯󰁩󰁴󰁩󰁥󰁲 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰃠 󰁬󰁡 󰁭󰁡󰁣󰁨󰁩󰁮󰁥 CRAPS, 󰁤󰁥 󰁴󰁡󰁩󰁬󰁬󰁥 1024 󰁭󰁯󰁴󰁳 󰁤󰁥 32 󰁢󰁩󰁴󰁳, 󰃠 󰁰󰁡󰁲󰁴󰁩󰁲 󰁤󰁥 󰁬󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁥 0󰁸50000000 󰁤󰁡󰁮󰁳 󰁬󲀙󰁥󰁳󰁰󰁡󰁣󰁥 󰁤󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁡󰁧󰁥 󰁤󰁵 󰁰󰁲󰁯󰁣󰁥󰁳󰁳󰁥󰁵󰁲. D󰃩󰁣󰁲󰁩󰁲󰁥 󰁴󰁯󰁵󰁴󰁥󰁳 󰁬󰁥󰁳 󰁭󰁯󰁤󰁩󰁦󰁩󰁣󰁡󰁴󰁩󰁯󰁮󰁳 󰃠 󰁥󰁦󰁦󰁥󰁣󰁴󰁵󰁥󰁲. 2 6 .   DECODAGE D󲀙ADRESSE O󰁮 󰁳󰁯󰁵󰁨󰁡󰁩󰁴󰁥 󰁲󰁡󰁪󰁯󰁵󰁴󰁥󰁲 󰃠 󰁬󰁡 󰁭󰁩󰁣󰁲󰁯󰁭󰁡󰁣󰁨󰁩󰁮󰁥 8 󰁡󰁵󰁴󰁲󰁥󰁳 󰁬󰁥󰁤󰁳, 󰁭󰁡󰁰󰁰󰃩󰁥󰁳 󰃠 󰁬󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁥 0󰁸80000000 󰁤󰁡󰁮󰁳 󰁬󲀙󰁥󰁳󰁰󰁡󰁣󰁥 󰁤󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁡󰁧󰁥 󰁤󰁵 󰁰󰁲󰁯󰁣󰁥󰁳󰁳󰁥󰁵󰁲. D󰃩󰁣󰁲󰁩󰁲󰁥 󰁴󰁯󰁵󰁴󰁥󰁳 󰁬󰁥󰁳 󰁭󰁯󰁤󰁩󰁦󰁩󰁣󰁡󰁴󰁩󰁯󰁮󰁳 󰃠 󰁥󰁦󰁦󰁥󰁣󰁴󰁵󰁥󰁲. 2 7 .   PROGRAMMATION DE CRAPS O󰁮 󰁳󰁵󰁰󰁰󰁯󰁳󰁥 󰁱󰁵󰁥 %󰁲2=0󰁸8000 P󰁯󰁵󰁲 󰁣󰁨󰁡󰁣󰁵󰁮 󰁤󰁥󰁳 󰁣󰁡󰁳 󰁳󰁵󰁩󰁶󰁡󰁮󰁴󰁳, 󰃩󰁣󰁲󰁩󰁲󰁥 󰁵󰁮󰁥 (󰁳󰁥󰁵󰁬󰁥) 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 󰁱󰁵󰁩 󰁥󰁦󰁦󰁥󰁣󰁴󰁵󰁥 󰁬󲀙󰁯󰁰󰃩󰁲󰁡󰁴󰁩󰁯󰁮 󰁤󰁥󰁭󰁡󰁮󰁤󰃩󰁥 : 󰀭  E󰁣󰁲󰁩󰁴 󰁥󰁮 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 %󰁲3 󰃠 󰁬󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁥 0󰁸FC

 

󰀭 

F󰁡󰁩󰁴 󰁥󰁮 󰁳󰁯󰁲󰁴󰁥 󰁱󰁵󰁥 󰁬󰁥 󰁦󰁬󰁡󰁧 Z 󰁩󰁮󰁤󰁩󰁱󰁵󰁥 󰁬󰁡 󰁮󰁵󰁬󰁬󰁩󰁴󰃩 󰁤󰁥 %󰁲1 (󰁤󲀙󰁡󰁵󰁴󰁲󰁥󰁳 󰁦󰁬󰁡󰁧󰁳 󰁰󰁥󰁵󰁶󰁥󰁮󰁴 󰃪󰁴󰁲󰁥 󰁭󰁯󰁤󰁩󰁦󰁩󰃩󰁳)

2 8 .   ASSEMBLAGE D󰁯󰁮󰁮󰁥󰁺 󰁬󰁥 󰁣󰁯󰁤󰁥 󰁭󰁡󰁣󰁨󰁩󰁮󰁥 󰁤󰁥󰁳 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮󰁳 󰁳󰁵󰁩󰁶󰁡󰁮󰁴󰁥󰁳 :

loop :

umulcc

%r1, -3, %r2

ld

[%r3+%r4], %r5

ba

loop 

2 9 .   DESASSEMBLAGE D󰁯󰁮󰁮󰁥󰁺 󰁬󲀙󰃩󰁣󰁲󰁩󰁴󰁵󰁲󰁥 󰁡󰁳󰁳󰁥󰁭󰁢󰁬󰁥󰁵󰁲 󰁤󰁥󰁳 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮󰁳 󰁤󰁥 󰁣󰁯󰁤󰁥󰁳 󰁳󰁵󰁩󰁶󰁡󰁮󰁴󰁳 : 0󰁸C4204000 0󰁸81C7E004 3 0 .   ACCELERATION DE L󲀙EXECUTION D󲀙UNE INSTRUCTION O󰁮 󰁤󰃩󰁳󰁩󰁲󰁥 󰁡󰁣󰁣󰃩󰁬󰃩󰁲󰁥󰁲 󰁬󲀙󰁥󰁸󰃩󰁣󰁵󰁴󰁩󰁯󰁮 󰁤󰁥󰁳 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮󰁳 󰁬󰁤 󰁡󰁶󰁥󰁣 2 󰃨󰁭󰁥 󰁯󰁰󰃩󰁲󰁡󰁮󰁤󰁥 󰁩󰁭󰁭󰃩󰁤󰁩󰁡󰁴. I󰁤󰃩󰁥 : 󰁦󰁡󰁩󰁲󰁥 󰁦󰁡󰁩󰁲󰁥 󰁳󰁩󰁭󰁵󰁬󰁴󰁡󰁮󰁥󰁭󰁥󰁮󰁴 󰁰󰁡󰁲 󰁬󲀙UAL 󰁬󰁥 󰁣󰁡󰁬󰁣󰁵󰁬 󰁤󰁥 󰁬󲀙󰁥󰁸󰁴󰁥󰁮󰁳󰁩󰁯󰁮 󰁤󰁥 󰁳󰁩󰁧󰁮󰁥 󰁤󰁥 󰁬󰁡 󰁣󰁯󰁮󰁳󰁴󰁡󰁮󰁴󰁥 ET 󰁬󰁡 󰁳󰁯󰁭󰁭󰁥 󰁤󰁥󰁳 󰁤󰁥󰁵󰁸 󰁯󰁰󰃩󰁲󰁡󰁮󰁤󰁥󰁳 󰁰󰁯󰁵󰁲 󰁬󰁥 󰁣󰁡󰁬󰁣󰁵󰁬 󰁤󰁥 󰁬󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁥 󰁭󰃩󰁭󰁯󰁩󰁲󰁥. P󰁲󰁯󰁰󰁯󰁳󰁥󰁲 󰁵󰁮󰁥 󰁭󰁯󰁤󰁩󰁦󰁩󰁣󰁡󰁴󰁩󰁯󰁮 󰁤󰁵 󰁧󰁲󰁡󰁰󰁨󰁥 󰁤󰁥 󰁳󰃩󰁱󰁵󰁥󰁮󰁣󰁥󰁭󰁥󰁮󰁴 󰁤󰁥 󰁣󰁥󰁴󰁴󰁥 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮 ET 󰁬󲀙󰁡󰁪󰁯󰁵󰁴 󰁤󲀙󰁵󰁮󰁥 󰁮󰁯󰁵󰁶󰁥󰁬󰁬󰁥 󰁦󰁯󰁮󰁣󰁴󰁩󰁯󰁮 󰁤󰁥 󰁬󲀙UAL (󰁱󰁵󰁥 󰁮󰃩󰁣󰁥󰁳󰁳󰁩󰁴󰁥 󰁣󰁥󰁴󰁴󰁥 󰁭󰃩󰁴󰁨󰁯󰁤󰁥). O󰁮 󰁳󰁰󰃩󰁣󰁩󰁦󰁩󰁥󰁲󰁡 󰁬󰁡 󰁮󰁯󰁵󰁶󰁥󰁬󰁬󰁥 󰁦󰁯󰁮󰁣󰁴󰁩󰁯󰁮 󰁤󰁥 󰁬󲀙UAL (󰁰󰁡󰁲 󰁵󰁮󰁥 󰁦󰁯󰁲󰁭󰁵󰁬󰁥 󰁯󰁵 󰁵󰁮󰁥 󰁰󰁨󰁲󰁡󰁳󰁥) 󰁳󰁡󰁮󰁳 󰁤󰃩󰁣󰁲󰁩󰁲󰁥 󰁳󰁯󰁮 󰁩󰁭󰁰󰁬󰃩󰁭󰁥󰁮󰁴󰁡󰁴󰁩󰁯󰁮, 󰁥󰁴 󰁯󰁮 󰁤󰁥󰁳󰁳󰁩󰁮󰁥󰁲󰁡 󰁬󰁥 󰁳󰁯󰁵󰁳󰀭󰁧󰁲󰁡󰁰󰁨󰁥 󰁤󰁥 󰁳󰃩󰁱󰁵󰁥󰁮󰁣󰁥󰁭󰁥󰁮󰁴 󰁭󰁯󰁤󰁩󰁦󰁩󰃩.

󰁃󰁈󰁁󰁐󰁉󰁔󰁒󰁅 󰀶

3 1 .   GESTION D󲀙UN CACHE V󰁯󰁩󰁣󰁩 󰁵󰁮 󰁣󰁡󰁣󰁨󰁥 󰁤󰁥 󰁴󰁹󰁰󰁥 󰂫 󰁤󰁩󰁲󰁥󰁣󰁴󰁥󰁤 󰁭󰁡󰁰󰁰󰁥󰁤 󰂻 󰁰󰁯󰁵󰁲 󰁵󰁮󰁥 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰁤󰁥 512 󰁭󰁯󰁴󰁳 󰁤󰁥 16 󰁢󰁩󰁴󰁳, 󰁡󰁶󰁥󰁣 󰁳󰁯󰁮 󰁣󰁯󰁮󰁴󰁥󰁮󰁵. valid dirty

Tag (7 bits)

Data (1 word)

00

0

0

0101100

0000 0000 0000 0000

01

1

1

1110000

1000 0000 1000 0000

10

1

0

0101010

0101 0000 0000 0000

11

0

0

0000000

0000 0000 0000 0000 1100 1100

address

7

2

TAG

LINE

4 cache lines

󰀭 

L󰁥 󰁭󰁯󰁴 󰁤󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁥 0󰁢010110001 󰁥󰁳󰁴󰀭󰁩󰁬 󰁤󰁡󰁮󰁳 󰁬󰁥 󰁣󰁡󰁣󰁨󰁥 ? S󰁩 󰁯󰁵󰁩 󰁱󰁵󰁥󰁬󰁬󰁥 󰁥󰁳󰁴 󰁬󰁡 󰁶󰁡󰁬󰁥󰁵󰁲 󰁡󰁳󰁳󰁯󰁣󰁩󰃩󰁥 ? S󰁩 󰁯󰁵󰁩, 󰁬󰁡 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰁥󰁳󰁴󰀭󰁥󰁬󰁬󰁥 󰃠 󰁪󰁯󰁵󰁲 ?

󰀭 

L󰁥 󰁭󰁯󰁴 󰁤󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁥 0󰁢111000001 󰁥󰁳󰁴󰀭󰁩󰁬 󰁤󰁡󰁮󰁳 󰁬󰁥 󰁣󰁡󰁣󰁨󰁥 ? S󰁩 󰁯󰁵󰁩 󰁱󰁵󰁥󰁬󰁬󰁥 󰁥󰁳󰁴 󰁬󰁡 󰁶󰁡󰁬󰁥󰁵󰁲 󰁡󰁳󰁳󰁯󰁣󰁩󰃩󰁥 ? S󰁩 󰁯󰁵󰁩, 󰁬󰁡 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰁥󰁳󰁴󰀭󰁥󰁬󰁬󰁥 󰃠 󰁪󰁯󰁵󰁲 ?

 

󰀭 

L󰁥 󰁭󰁯󰁴 󰁤󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁥 0󰁢000000011 󰁥󰁳󰁴󰀭󰁩󰁬 󰁤󰁡󰁮󰁳 󰁬󰁥 󰁣󰁡󰁣󰁨󰁥 ? S󰁩 󰁯󰁵󰁩 󰁱󰁵󰁥󰁬󰁬󰁥 󰁥󰁳󰁴 󰁬󰁡 󰁶󰁡󰁬󰁥󰁵󰁲 󰁡󰁳󰁳󰁯󰁣󰁩󰃩󰁥 ? S󰁩 󰁯󰁵󰁩, 󰁬󰁡 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰁥󰁳󰁴󰀭󰁥󰁬󰁬󰁥 󰃠 󰁪󰁯󰁵󰁲 ?

󰀭 

S󰁩 󰁬󰁡 󰁤󰁯󰁮󰁮󰃩󰁥 0󰁸1234 󰁳󰁩󰁴󰁵󰃩󰁥 󰁥󰁮 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰃠 󰁬󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁥 0󰁸1BA 󰃩󰁴󰁡󰁩󰁴 󰁤󰁡󰁮󰁳 󰁬󰁥 󰁣󰁡󰁣󰁨󰁥, 󰁣󰁯󰁭󰁭󰁥󰁮󰁴 󰁡󰁰󰁰󰁡󰁲󰁡󰁩󰁴󰁲󰁡󰁩󰁴󰀭 󰁥󰁬󰁬󰁥 ?

3 2 .   PROTOCOLE MESI DE COHERENCE DE CACHES O󰁮 󰁳󰁵󰁰󰁰󰁯󰁳󰁥 󰁬󲀙󰁥󰁸󰁩󰁳󰁴󰁥󰁮󰁣󰁥 󰁤󰁥 3 󰁰󰁲󰁯󰁣󰁥󰁳󰁳󰁥󰁵󰁲󰁳 CPU1󲀦CPU3 󰁡󰁹󰁡󰁮󰁴 󰁣󰁨󰁡󰁣󰁵󰁮 󰁵󰁮󰁥 󰁣󰁡󰁣󰁨󰁥 󰁬󰁩󰁮󰁥 CL1󲀦CL3 󰁰󰁯󰁵󰁲 󰁵󰁮󰁥 󰁭󰃪󰁭󰁥 󰁺󰁯󰁮󰁥 󰁤󰁥 󰁤󰁯󰁮󰁮󰃩󰁥󰁳 󰁥󰁮 󰁭󰃩󰁭󰁯󰁩󰁲󰁥, 󰁮󰁯󰁭󰁭󰃩󰁥 A. O󰁮 󰁳󰁵󰁰󰁰󰁯󰁳󰁥 󰃩󰁧󰁡󰁬󰁥󰁭󰁥󰁮󰁴 󰁱󰁵󰁥 󰁣󰁥󰁴󰁴󰁥 󰁺󰁯󰁮󰁥 A 󰁥󰁳󰁴 󰁡󰁣󰁣󰃩󰁤󰃩󰁥 󰁰󰁡󰁲 󰁬󰁥󰁳 3 CPU 󰁳󰁥󰁬󰁯󰁮 󰁬󰁡 󰁳󰃩󰁱󰁵󰁥󰁮󰁣󰁥 󰁳󰁵󰁩󰁶󰁡󰁮󰁴󰁥 : CPU1 󰁬󰁩󰁴 A ; CPU2 󰁬󰁩󰁴 A ; CPU1 󰁭󰁯󰁤󰁩󰁦󰁩󰁥 A ; CPU3 󰁭󰁯󰁤󰁩󰁦󰁩󰁥 A ; CPU1 󰁬󰁩󰁴 A 󰀭 

D󰃩󰁣󰁲󰁩󰁲󰁥 󰁬󲀙󰃩󰁶󰁯󰁬󰁵󰁴󰁩󰁯󰁮 󰁤󰁥󰁳 󰁢󰁩󰁴󰁳 MESI 󰁤󰁥 󰁣󰁥󰁳 󰁣󰁡󰁣󰁨󰁥󰁳 󰁬󰁩󰁮󰁥󰁳, 󰁤󰁥󰁰󰁵󰁩󰁳 󰁵󰁮󰁥 󰁳󰁩󰁴󰁵󰁡󰁴󰁩󰁯󰁮 󰁩󰁮󰁩󰁴󰁩󰁡󰁬󰁥 󰁯󰃹 󰁩󰁬󰁳 󰁳󰁯󰁮󰁴 󰁴󰁯󰁵󰁳 󰁩󰁮󰁶󰁡󰁬󰁩󰁤󰁥󰁳

󰀭 

I󰁮󰁤󰁩󰁱󰁵󰁥󰁲 󰁴󰁯󰁵󰁳 󰁬󰁥󰁳 󰁡󰁣󰁣󰃨󰁳 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 (󰁬󰁥󰁣󰁴󰁵󰁲󰁥 󰁥󰁴 󰃩󰁣󰁲󰁩󰁴󰁵󰁲󰁥) 󰁥󰁦󰁦󰁥󰁣󰁴󰁵󰃩󰁳

3 3 .   MEMOIRE VIRTUELLE PAGINEE O󰁮 󰁳󰁵󰁰󰁰󰁯󰁳󰁥 󰁬󲀙󰁥󰁸󰁩󰁳󰁴󰁥󰁮󰁣󰁥 󰁤󲀙󰁵󰁮󰁥 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰁲󰃩󰁥󰁬󰁬󰁥 󰁤󰁥 4 󰁰󰁡󰁧󰁥󰁳 󰁦󰁲󰁡󰁭󰁥󰁳, 󰁥󰁴 󰁤󲀙󰁵󰁮󰁥 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰁶󰁩󰁲󰁴󰁵󰁥󰁬󰁬󰁥 󰁤󰁥 8 󰁰󰁡󰁧󰁥󰁳, 󰁡󰁶󰁥󰁣 󰁵󰁮󰁥 󰁴󰁡󰁢󰁬󰁥 󰁤󰁥󰁳 󰁰󰁡󰁧󰁥󰁳 󰁤󰁥 󰁬󰁡 󰁦󰁯󰁲󰁭󰁥 󰁳󰁵󰁩󰁶󰁡󰁮󰁴󰁥 : present page #

dirty

adresse disque

page frame #

0 1 2 3 4 5 6 7

O󰁮 󰁳󰁵󰁰󰁰󰁯󰁳󰁥 󰁱󰁵󰁥 󰁬󰁥 󰁳󰁹󰁳󰁴󰃨󰁭󰁥 󰁵󰁴󰁩󰁬󰁩󰁳󰁥 󰁬󰁡 󰁳󰁴󰁲󰁡󰁴󰃩󰁧󰁩󰁥 FIFO 󰁬󰁯󰁲󰁳󰁱󰁵󲀙󰁵󰁮󰁥 󰁰󰁡󰁧󰁥 󰁦󰁲󰁡󰁭󰁥 󰁥󰁳󰁴 󰁲󰁥󰁣󰁯󰁰󰁩󰃩󰁥 󰁳󰁵󰁲 󰁬󰁥 󰁤󰁩󰁳󰁱󰁵󰁥. O󰁮 󰁳󰁵󰁰󰁰󰁯󰁳󰁥 󰃩󰁧󰁡󰁬󰁥󰁭󰁥󰁮󰁴 󰁱󰁵󰁥 󰁬󰁡 󰁴󰁲󰁡󰁤󰁵󰁣󰁴󰁩󰁯󰁮 󰁤󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁥 󰁥󰁳󰁴 󰁦󰁡󰁩󰁴󰁥 󰁳󰁵󰁲 󰁬󰁥 󰁳󰁣󰁨󰃩󰁭󰁡 󰁳󰁵󰁩󰁶󰁡󰁮󰁴 : page # 100

page frame # 1101000110

adresse virtuelle

11

1101000110

adresse réelle

1.  Q󰁵󰁥󰁬󰁬󰁥 󰁥󰁳󰁴 󰁬󰁡 󰁴󰁡󰁩󰁬󰁬󰁥 󰁤󰁥 󰁬󰁡 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰁶󰁩󰁲󰁴󰁵󰁥󰁬󰁬󰁥 ? D󰁥 󰁬󰁡 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰁲󰃩󰁥󰁬󰁬󰁥 ? Q󰁵󰁥󰁬󰁬󰁥 󰁥󰁳󰁴 󰁬󰁡 󰁴󰁡󰁩󰁬󰁬󰁥 󰁤󰁥󰁳 󰁰󰁡󰁧󰁥󰁳 ? 2.  O󰁮 󰁰󰁡󰁲󰁴 󰁤󲀙󰁵󰁮 󰃩󰁴󰁡󰁴 󰁩󰁮󰁩󰁴󰁩󰁡󰁬 󰁯󰃹 󰁡󰁵󰁣󰁵󰁮󰁥 󰁰󰁡󰁧󰁥 󰁮󲀙󰁥󰁳󰁴 󰁰󰁲󰃩󰁳󰁥󰁮󰁴󰁥 󰁥󰁴 󰁬󰁥 󰁰󰁲󰁯󰁣󰁥󰁳󰁳󰁥󰁵󰁲 󰁦󰁡󰁩󰁴 󰁵󰁮 󰁰󰁲󰁥󰁭󰁩󰁥󰁲 󰁡󰁣󰁣󰃨󰁳 󰁭󰃩󰁭󰁯󰁩󰁲󰁥, 󰁥󰁮 󰃩󰁣󰁲󰁩󰁴󰁵󰁲󰁥, 󰃠 󰁬󲀙󰁡󰁤󰁲󰁥󰁳󰁳󰁥 󰁶󰁩󰁲󰁴󰁵󰁥󰁬󰁬󰁥 0󰁸0F46. D󰃩󰁣󰁲󰁩󰁲󰁥 󰁬󲀙󰃩󰁶󰁯󰁬󰁵󰁴󰁩󰁯󰁮 󰁤󰁥󰁳 󰁢󰁩󰁴󰁳: 󰁰󰁲󰁥󰁳󰁥󰁮󰁴󰀬 󰁤󰁩󰁲󰁴󰁹󰀬 󰁤󰁩󰁲󰁴󰁹󰀬  󰁰󰁡󰁧󰁥 󰁦󰁲󰁡󰁭󰁥 󰁦󰁲󰁡󰁭󰁥 󰁤󰁡󰁮󰁳 󰁬󰁡 󰁴󰁡󰁢󰁬󰁥 󰁤󰁥󰁳 󰁰󰁡󰁧󰁥󰁳, 󰁥󰁴 󰁩󰁮󰁤󰁩󰁱󰁵󰁥󰁲 󰁱󰁵󰁥󰁬󰁳 󰁡󰁣󰁣󰃨󰁳 󰃠 󰁬󰁡 󰁭󰃩󰁭󰁯󰁩󰁲󰁥 󰁲󰃩󰁥󰁬󰁬󰁥 󰁥󰁴 󰁱󰁵󰁥󰁬󰁳 󰁡󰁣󰁣󰃨󰁳 󰁤󰁩󰁳󰁱󰁵󰁥 󰁯󰁮󰁴 󰃩󰁴󰃩 󰁥󰁦󰁦󰁥󰁣󰁴󰁵󰃩󰁳. 3.  F󰁡󰁩󰁲󰁥 󰁤󰁥 󰁭󰃪󰁭󰁥 󰁥󰁮 󰁣󰁯󰁮󰁴󰁩󰁮󰁵󰁡󰁮󰁴 󰁡󰁶󰁥󰁣 󰁬󰁥󰁳 󰁡󰁣󰁣󰃨󰁳 󰁳󰁵󰁩󰁶󰁡󰁮󰁴󰁳 󰁤󰁵 󰁰󰁲󰁯󰁣󰁥󰁳󰁳󰁥󰁵󰁲 : 󰁬󰁥󰁣󰁴󰁵󰁲󰁥 󰁥󰁮 0󰁸0F46 ; 󰃩󰁣󰁲󰁩󰁴󰁵󰁲󰁥 󰁥󰁮 0󰁸0800 ; 󰃩󰁣󰁲󰁩󰁴󰁵󰁲󰁥 󰁥󰁮 0󰁸0F00 ; 󰁬󰁥󰁣󰁴󰁵󰁲󰁥 󰁥󰁮 0󰁸0804 ; 󰁬󰁥󰁣󰁴󰁵󰁲󰁥 󰁥󰁮 0󰁸0C00 ; 󰁬󰁥󰁣󰁴󰁵󰁲󰁥 󰁥󰁮 0󰁸1800 ; 󰁬󰁥󰁣󰁴󰁵󰁲󰁥 󰁥󰁮 0󰁸1C00 ; 󰁬󰁥󰁣󰁴󰁵󰁲󰁥 󰁥󰁮 0󰁸0400

 

3 4 .   PIPELINE O󰁮 󰁣󰁯󰁮󰁳󰁩󰁤󰃨󰁲󰁥 󰁬󰁥 󰁰󰁲󰁯󰁧󰁲󰁡󰁭󰁭󰁥 󰁳󰁵󰁩󰁶󰁡󰁮󰁴 :

loop:

setq

10, %r1

clr

%r2

add

%r1, %r2, %r2

deccc

%r1

bne i6

loop

i7

I󰁮󰁤󰁩󰁱󰁵󰁥󰁲 󰁤󰁡󰁮󰁳 󰁬󰁥 󰁴󰁡󰁢󰁬󰁥󰁡󰁵 󰁳󰁵󰁩󰁶󰁡󰁮󰁴 󰁣󰁯󰁭󰁭󰁥󰁮󰁴 󰁬󰁥󰁳 󰁩󰁮󰁳󰁴󰁲󰁵󰁣󰁴󰁩󰁯󰁮󰁳 󰁰󰁲󰁯󰁧󰁲󰁥󰁳󰁳󰁥󰁮󰁴 󰁤󰁡󰁮󰁳 󰁬󰁥 󰁰󰁩󰁰󰁥󰁬󰁩󰁮󰁥, 󰁩󰁮󰁩󰁴󰁩󰁡󰁬󰁥󰁭󰁥󰁮󰁴 󰁣󰁯󰁭󰁰󰁬󰃨󰁴󰁥󰁭󰁥󰁮󰁴 󰁲󰁥󰁭󰁰󰁬󰁩 󰁤󰁥 󰁢󰁵󰁬󰁬󰁥󰁳. O󰁮 󰁳󰁵󰁰󰁰󰁯󰁳󰁥󰁲󰁡 󰁱󰁵󰁥 󰁬󰁥󰁳 󰁢󰁲󰁡󰁮󰁣󰁨󰁥󰁭󰁥󰁮󰁴󰁳 󰁩󰁮󰁴󰁲󰁯󰁤󰁵󰁩󰁳󰁥󰁮󰁴 󰁳󰁹󰁳󰁴󰃩󰁭󰁡󰁴󰁩󰁱󰁵󰁥󰁭󰁥󰁮󰁴 󰁵󰁮 󰁡󰁬󰃩󰁡 󰁤󰁥 󰁣󰁯󰁮󰁴󰁲󰃴󰁬󰁥 󰁳󰁡󰁮󰁳 󰁰󰁲󰃩󰁤󰁩󰁣󰁴󰁩󰁯󰁮. 󰁣󰁹󰁣󰁬󰁥

󰁐󰁃

󰁉󰁮󰁳󰁴󰁲

󰁁󰁲󰁧󰁳

󰁃󰁡󰁬󰁣

󰁍󰁥󰁭

󰁒󰁥󰁳󰁵󰁬󰁴

1

󰁯

󰁯

󰁯

󰁯

󰁯

󰁯