MC
MC
Types of computer
1. Main frame
Largest and most powerful computer may need entire room design to work at very high
speed with lager data. Typically 64 bits. Used in military defense control
2. Mini computer
Scale down version of main frame computer are called minicomputer. Usually get fit into a
single rack as a box, runs very slowly and works directly with smallest data words. Used for
business data processing, industrial control.
3. Micro computer
As the name implies microcomputer are small computers. They range from small controllers
that work directly with 4 bit words. And can address 1000 bites of memory one distinguish
feature is CPU is usually a single integrated circuit called micro processor
Programmable- Perform Different set operation on the data depending on the sequence of
instructions supplied by the programmer.
Clock Driven – Whole task is divided into basic operations, are Divided into precise system
clock periods.
Register Based – Storage element
Microprocessor: - It is a programmable VLSI chip which includes ALU, register circuits & control
circuits. Its main unit’s are-
ALU
Registers
Control Unit
Microcontroller: - Silicon chip which includes microprocessor, memory & I/O in a single package
Memory:
Stores information such as instructions and data in binary format (0 and 1).
Sub-system” of microprocessor-based system. sub-system includes the registers
1. Read Only Memory (ROM): used to store programs that do not need alterations.
2. Random Access Memory (RAM) (R/WM): used to store programs that can read and altered
like programs and data.
System Bus: Communication path between the microprocessor and peripherals. Group of wires to
carry bits.
Stack Pointer
• It passes this information via read or writes control lines that are between the processor and
DMA controllers control logic unit.
2. The processor also provides the starting address of/ for the data block in the memory, from
where the data block in memory has to be read or where the data block has to be written in
memory.
• DMA controller stores this in its address register. It is also called the starting address
register.
3. The processor also sends the word count, i.e. how many words are to be read or written.
• It stores this information in the data count or the word count register.
4. The most important is the address of I/O device that wants to read or write data. This
information is stored in the data register.
1. Programmed I/O
• In the programmed I/O method of interfacing, CPU has direct control over I/O
• The processor checks the status of the issues read or write commands and then transfers data.
• During the data transfer, CPU waits for 1/0 module to complete operation and hence this system
wastes the CPU time.
update
decode
register file &
instruction
pc
access
alu opeation
memory
Von Neumann & Harvard Architecture
Von Neumann Architecture Harvard Architecture
RISC vs CISC
RISC CISC
It is a Reduced Instruction Set Computer. It is a Complex Instruction Set Computer.
It emphasizes on software to optimize the It emphasizes on hardware to optimize the
instruction set. instruction set.
It requires multiple register sets to store the It requires a single register set to store the
instruction. instruction.
RISC has simple decoding of instruction. CISC has complex decoding of instruction.
Uses of the pipeline are simple in RISC. Uses of the pipeline are difficult in CISC.
It uses a limited number of instruction that It uses a large number of instruction that
requires less time to execute the instructions. requires more time to execute the instructions.
It uses LOAD and STORE that are independent It uses LOAD and STORE instruction in the
instructions in the register-to-register a instructions in the memory-to-memory
program’s interaction interaction of a program.
RISC has more transistors on memory registers. CISC has transistors to store complex
instructions.
The execution time of RISC is very short. The execution time of CISC is longer.
RISC architecture can be used with high-end CISC architecture can be used with low- end
applications like telecommunication, image applications like home automation, security
processing, video processing, etc. system, etc.
The program written for RISC architecture Program written for CISC architecture tends to
needs to take more space in memory. take less space in memory.
Example of RISC: ARM, PA-RISC, Power
Architecture, Alpha, AVR, ARC and the SPARC. Examples of CISC: VAX, Motorola 68000 family,
System/360, AMD and the Intel x86 CPUs.
Important vocabulary
opcode (operation code) - It's a binary code that indicates operations to be
performed.
Operands - The data on which operations to be performed. (As well as result
of an operation).
Instruction - Combination of opcode and operand that can be used to instruct
a system is called instruction.
Instruction set - A list of all the instructions that can be issued to a system is
called instruction set of that system.
Program / Subroutine / routine - A set of instructions written in a particular
sequence so as to implement a given task.
Bus - A group of lines, pins or signals having common function is termed as
bus. Data bus to carry data. Address bus to select memory and I/p o/p
locations. Control bus to issue and receive control signals.
Subroutine - In computer programming, a sequence of instructions that
perform a specific task. A subroutine is a block of instructions that are packed
together as a unit and can then be used in a program whenever that particular
task should be performed. Subroutines may be defined within the main
program or separately in libraries.
Program Counter (PC) - A register (PU register) which has the address of
the instruction to be executed next in a computer processor. It is also known
as instruction counter, instruction pointer, instruction address register or
sequence control register.
Stack - A data structure used to store a collection of objects. Data can be
added (objects can be stored) due to a push operation and objects can be
retrieved using a pop operation. When an object is added to the stack, it is
placed on the top of the stack. It can then be removed from the top of the
stack. If a stack is full and an attempt is made to push data onto the stack, it
will cause a stack overflow.