Presentation is loading. Please wait.

Presentation is loading. Please wait.

Theory of Computer Science Instruction set for machine W.

Similar presentations


Presentation on theme: "Theory of Computer Science Instruction set for machine W."— Presentation transcript:

1 Theory of Computer Science Instruction set for machine W

2 Theory of Computer Science - Instruction set for machine W Von Neumanns architecture John von Neumann together with John W. Mauchly and John Presper Eckert. 1 2 3

3 Theory of Computer Science - Instruction set for machine W Von Neumanns architecture – 3 bus connection

4 Theory of Computer Science - Instruction set for machine W Von Neumanns architecture CPU (ALU and CU) + Memory (storing data and program) + I/O system Between CPU end memory there is only one data bus Computer of this architecture, store the program in memory Instructions are processed in sequence in CPU Architecture that have finished, and functionally fully, list of instructions.

5 Theory of Computer Science - Instruction set for machine W The format and the list of instructions for the machine W Symbol code content DOD 001(AK) + ((AD)) AK ODE 010(AK) - ((AD)) AK ŁAD 011(AK) (AD) POB 100((AD)) AK SOB 101(AD) L SOM 110(AD) L, if (AK) < 0 STP111 stop – the end of program

6 Theory of Computer Science - Instruction set for machine W Basic elements The computer program – ordered set of elementary instructions The list of instructions – the gathering of all accessible instructions, for the given computer The instruction – ordered set of steering signals – microinstructions The instruction is divided into cycles – its impossible to do everything during one cycle

7 Theory of Computer Science - Instruction set for machine W The order cycle - the foundation At the beginning there is delivery and decoding the instruction (czyt, wys, wei – from memory to instruction register) and increment of the value of the counter register (il) At the end there is the preparation to the realization of the next instruction (wyl, wea) (so we have address of next instruction in address register) Format of the instruction: 3 bits of code +5 bits of address (argument of instruction) code - 3 bitsaddress - 5 bits

8 Theory of Computer Science - Instruction set for machine W The addition instruction DOD (AK) + ((AD)) AK ((A)) S czyt (S) I wys wei (L) + 1 Lil (AD) A wyad wea ((A)) S czyt (AK) + (S) AK wys weja dod weak (L) A wyl wea

9 Theory of Computer Science - Instruction set for machine W The addition instruction DOD (AK) + ((AD)) AK DOD a a: RST 4 czyt wys wei il It is important to not use wei, except this first cycle of instruction. We need to keep the code of instruction in reg. I, in this way processor know what instruction is processed wyad weaWe are taking the address of argument to reg. A and then we reed this argument czyt wys weja dod weak wyl wea At the end of instruction, it is important to prepare address of next instruction 3 cycles of processor

10 Theory of Computer Science - Instruction set for machine W 3 cycles of processor

11 Theory of Computer Science - Instruction set for machine W The addition instruction DOD (AK) + ((AD)) AK ((A)) S czyt (S) I wys wei (L) + 1 Lil (AD) A wyad wea ((A)) S czyt (AK) + (S) AK wys weja dod weak (L) A wyl wea

12 Theory of Computer Science - Instruction set for machine W The instruction DOD czyt = (F1+F3)DOD wys = (F1+F3)DOD wei = f1DOD il = f1DOD wyad = F2DOD wea = (f2+f3)DOD weja = F3DOD dod = F3DOD weak = f3DOD wyl = F3DOD

13 Theory of Computer Science - Instruction set for machine W The instruction ODE (AK) - ((AD)) AK ((A)) S czyt (S) I wys wei (L) + 1 L il (AD) A wyad wea ((A)) S czyt (AK) - (S) AK wys weja ode weak (L) A wyl wea

14 Theory of Computer Science - Instruction set for machine W The instruction ODE czyt = (F1+F3)ODE wys = (F1+F3)ODE wei = f1ODE il = f1ODE wyad = F2ODE wea = (f2+f3)ODE weja = F3ODE ode = F3ODE weak = f3ODE wyl = F3ODE

15 Theory of Computer Science - Instruction set for machine W The instruction POB ((AD)) AK ((A)) S czyt (S) I wys wei (L) + 1 L il (AD) A wyad wea ((A)) S czyt (S) AK wys weja przep weak (L) A wyl wea

16 Theory of Computer Science - Instruction set for machine W The instruction POB czyt = (F1+F3)POB wys = (F1+F3)POB wei = f1POB il = f1POB wyad = F2POB wea = (f2+f3)POB weja = F3POB przep = F3POB weak = f3POB wyl = F3POB

17 Theory of Computer Science - Instruction set for machine W The instruction LAD (AK) (AD) ((A)) S czyt (S) I wys wei (L) + 1 L il (AD) A wyad wea (AK) S wyak wes (S) (A) pisz (L) A wyl wea

18 Theory of Computer Science - Instruction set for machine W The instruction LAD czyt = F1ŁAD wys = F1ŁAD wei = f1ŁAD il = f1ŁAD wyad = F2ŁAD wea = (f2+f3)ŁAD wyak = F2ŁAD wes = F3ŁAD pisz = f3ŁAD wyl = F3ŁAD

19 Theory of Computer Science - Instruction set for machine W The instruction SOB – jump to the address (AD) L ((A)) S czyt (S) I wys wei (L) + 1 L il (AD) A wyad wea (AD) L wyad wel

20 Theory of Computer Science - Instruction set for machine W The instruction SOB – jump to the address czyt = F1SOB wys = F1SOB wei = f1SOB il = f1SOB wyad = F2SOB wea = f2SOB wel = f2SOB

21 Theory of Computer Science - Instruction set for machine W The instruction SOM – jump to the address only if value in accumulator is negative (L) + 1 L ((A)) S czyt (S) Iwys wei (L) + 1 L il If z=0 (L) A wyl wea ((A)) S czyt (S) I wys wei (L) + 1 L il If z=1 (AD) L wyad wel (AD) A wyad wea

22 Theory of Computer Science - Instruction set for machine W The instruction SOM – jump to the address only if value in accumulator is negative czyt = F1SOMZ wys = F1SOMZ wei = f1SOB+SOMZ il = f1SOMZ wyl = F2SOMZ wea = f2SOMZ If z=0

23 Theory of Computer Science - Instruction set for machine W Jump inside instruction:..... z @0;jump to @0 if AK < 0.... @0;.... Instruction is executed from beginning to end, with optional jump, and optional sign of exclamation mark '!', which stopped execution of instruction..... The opposite condition, with the word nie: nie z @0; jump to @0 if AK >= 0.... @0;....

24 Theory of Computer Science Instruction set for machine W

25 Theory of Computer Science - Instruction set for machine W L Bus A Bus S Memory ALU I wyad wei wes wys wea wejaweak wel wyl

26 Theory of Computer Science - Instruction set for machine W L Bus A Bus S Memory ALU I wyad wei wes wys wea wejaweak wel wyl Data Processing Path

27 Theory of Computer Science - Instruction set for machine W L Bus A Bus S Memory ALU I wyad wei wes wys wea wejaweak wel wyl Instruction Processing Path

28 Theory of Computer Science - Instruction set for machine W L Bus A Bus S Memory ALU I wyad wei wes wys wea wejaweak wel wyl Data Processing Path Instruction Processing Path

29 Theory of Computer Science - Instruction set for machine W W ABS |((Ad))|->AK PGMif (Ak) L else (L)+1->L MIN min( (Ak),((Ad)) )->Ak SNZif (Ak) <>0 to (Ad)->L else (L)+1->L W+ DDP(Ak)+(((Ad)))->Ak ZAM((Ad)) ((L)+1) DIS(Ak)-1->Ak and next: if (Ak) L else (L)+1->L SAW(L)+(Ad)->L


Download ppt "Theory of Computer Science Instruction set for machine W."

Similar presentations


Ads by Google