CA Classes-51-55
CA Classes-51-55
CA Classes-51-55
References:
David Salomon, (2008), Computer Organisation, NCC Blackwell.
John L. Hennessy and David A. Patterson, Computer Architecture:
A Quantitative Approach, (4th Ed.), Morgan Kaufmann Publishers
Joseph D. Dumas II; Computer Architecture; CRC Press
Nicholas P. Carter; Schaum’s outline of computer Architecture;
Mc. Graw-Hill Professional
E-references:
http://publib.boulder.ibm.com/infocenter/zos/basics/topic/com.ibm.zos.z
concepts/zconcepts_75.html/ Retrieved on 30-03-2012
http://www.ibm.com/search/csass/search?sn=mh&q=multiprocessing
%20system&lang=en&cc=us&/ Retrieved on 31-03-2012
3.1 Introduction
In the previous unit, you have studied about fundamentals of computer
architecture and design. Now we will study in detail about the instruction set
and its principles.
The instruction set or the instruction set architecture (ISA) is the set of basic
instructions that a processor understands. In other words, an instruction set,
or instruction set architecture (ISA), is the part of the computer architecture
related to programming, including the native data types, instructions,
registers, addressing modes, memory architecture, interrupt and exception
handling, and external I/O. There are a number of instructions in a program
that have to be accessed in a particular sequence. This encourages us to
describe the issue of instruction and its sequence which we will study in this
unit. In this unit, you will study the fundamentals involved in instruction set
architecture and design. Firstly, the operations in the instruction sets,
The zero-address format is used by all other instructions. Now, we will see
how the stack machine converts the arithmetic expression we studied the
earlier subsections. In these machines, the statement:
A=B+C*D-E+F+A
is translated to the following code:
push E ; <E>
push C ; <C, E>
push D ; <D, C, E>
mult ;<C*D, E>
push B ; <B, C*D, E>
add ;<B+C*D, E>
sub ;<B+C*D-E>
push F ; <F, B+D*C-E>
add ;<F+B+D*C-E>
push A ; <A, F+B+D*C-E>
add ;<A+F+B+D*C-E>
pop A ; <>
On the right, we show the state of the stack after executing each instruction.
The top element of the stack is shown on the left. Notice that we pushed E
early because we need to subtract it from (B+C*D).