.

wrn--u I ER SCIENCEwith python

; erse__

Tlu·1 1~
 ~I5C

. w
RISC & CISC Comparison
RISC CISC
1. RISC stands for Reduced Instruction Set Computer. 1. CISC stands for Complex Instruction Set Computer.
2. RISC processors have simple instructions taking 2. CSIC processor has complex instructions that take
about one clock cycle. The average clock cycle per up multiple clocks for execution. The average clock
instruction (CPI} is 1.5 cycle per instruction (CPI} is in the range of 2 and 15.
3. Performance is optimized with more focus on 3. Performance is optimized with more focus on
software hardware.
4. It has no memory unit and uses a separate 4 . It has a memory unit to implement complex
hardware to implement instructions .. instructions.
5. It has a hard-wired unit of programming. 5. It has a microprogramming unit.
6. The instruction set is reduced i.e. It has only a few 6. The instruction set has a variety of different
instructions in the instruction set. Many of these instructions that can be used for complex
instructions are very primitive. operations.
7. The instruction set has a variety of different 7. CISC has many different addressing modes and
Instructions that can be used for complex can thus be used to represent higher-level
operations. programming language statements more efficiently.
8. Complex addressing modes are synthesized using
8. CISC already supports complex addressing modes
the software.
9. Multiple register sets are present 9. Only has a single register set
10. RISC processors are highly pipelined 10. They are normally not pipelined or less pipelined
11. The complexity of RISC lies with the compiler that
11. The complexity lies in the microprogram
executes the program
12. Execution time is very less 12. Execution time is very high
13. Code expansion can be a problem 13. Code expansion is not a problem
14. Decoding of instrucUons is simple. 14. Decoding of instructions is complex
15. It does not require external memory for
15. It requires external memory for calculations
calculations
16. The most common RISC microprocessors are 16. Examples of CISC processors are the System/360,
Alpha, ARC, ARM, AVR, MIPS, PA-RISC, PIC, Power VAX, POP-11, Motorola 68000 family, AMO and Intel
Architecture, and SPARC. x86 CPUs.
17. RISC architecture is used in high-end applications
17. CISC architecture is used in low-end applications
such as video processing, telecommunications and
such as security systems, home automation, etc.
image processing.
 c./,i,ssMAte.
~ \\
~
'P~
----n--~"--=-...:_.:..____..:__ ~ 1... f,,,,J,.,. ~ . · vuw
--lif r,-- -.--- -=--~ ~ ~~ ~-~~~- f~ k
h,_- k& I

. TJ-

l Th! ro
I

I'

I
I I

I l1

/I
./

· 5 I M1)

' .. ' J
.• .,
I
. - - ~ - - - - - - - - - - - ---~=~ ~
: .:!._;~-
~-=-=---=,- - - ; _ - ~ II
l - - - ---rr

•
Liil l t: I t::111..t: Ut: LWt:t::11 UIYI I-\ d ll U l'I U IYII-\~

NUMA stands for Non-uniform M emory

1. UMA stands for Uniform Memory Access. Access.

In Uniform Memory Access, Single In Non-uniform Memory Access, Different

2. memory controller is used. memory controller is used.

Uniform Memory Access is slower than Non-uniform Memory Access is faster

3. non-uniform Memory Access. than uniform Memory Access.

Uniform Memory Access has limited Non-uniform Memory Access has more
4. bandwidth. bandwidth than uniform Memory Access.

Uniform Memory Access is applicable for Non-uniform Memory Access is applicable

general purpose applications and time- for real-time applications and time-critical
s. sharing applications. applications.

6. In uniform Memory Access, memory In non-uniform Memory Access, memory

access time is balanced or equal. access time is not equal.

There are 3 types of buses used in While in non-uniform Memory Access,

uniform Memory Access which are: There are 2 types of buses used which
7. Single, Multiple and Crossbar. are: Tree and hierarchical.

Difference between loosely coupled and tightly coupled multiprocessor system:

There is shared memory, in

There is distributed memory in loosely coupled tightly coupled multiprocessor
1. multiprocessor system. system.

Loosely Coupled Multiprocessor System has low Tightly coupled multiprocessor

2. data rate. system has high data rate.

The cost of loosely coupled multiprocesso r Tightly coupled multiprocessor

3. system is less. system is more costly.

In loosely coupled multiprocessor system,

modules are co nnected through Message transfer While there is PMIN, IOPIN and
4. system network. ISIN networks.

While tight ly coupled

In loosely coupled multiprocessor, Memory multiprocessor system have
s. conflicts don't take place. memory conflicts.
lluJ

~ ;'11-lv. - ~ ~ c J ;o,,, i
¥ 'D;st.1ubutl 01M J ~

~ ,µJ
r rJ. .,.---_jr ~ ~ ~ ~--=-
1
:?'t ~ J--_----H--- - -r,
Messa1e Passlnc vs. DSM
Messaa• passln1 I Distributed shared memory
Variables have to be marshalled Variables are shared directly

Cost of communication Is obvious ICost of communication is Invisible

Processes are protected by having private addres~ Id b d
Processes cou cause error y aIterlng ata
space

Executing the processes may happen with non-overlapping

Processes should execute at the same time
lifetimes

Advant11es
• Scales well with a large number of nodes
• Message passing Is hidden
• Can handle complex and large databases without replication or sending the data to processes
• Generally cheaper than using a multiprocessor system
• Provides large virtual memory space
• Programs are more portable due to common programming interfaces
• Shield programmers from sending or receiving primitives
Dlsadvanta1es
• Generally slower to access than non-distributed shared memory
• Must provide additional protection against simultaneous accesses to shared data
• May Incur a performance penalty
• Little programmer control over actual messages beln1 1enerated
• Programmers need to understand consistency models, to write correct programs
• DSM Implementations use asynchronous message-passing, and hence cannot be more efficient than
message-passing implementations
 . -________ -----+t-_1_~-=- -.c~ {. ,,,..J,..., /\) a,., b,

~ - - - - ~ - - J t - - - - - ,_ _ _ _ _ _. ~ --- ~.,, ~ .

- - - ,___----tt_ i)
_13u. ~
_ _ _ _:-..____y/
_{,,,._ ~ '' ~ ,,f., """4, ,£ .,, ,le,.
• ~cl. '1 ~ of ~I ~ ~ •

..scdio J-i .

~-< ;- J ~ ~ ,.,, ~ct aJ, ~

~~~ Cl l ~ ,{-~ ~ ~ ~
; rc -
- ---+---- - ~-L..:._=v-~~=--~- - I~

~ -?{ . '
1i·i .i j
. -#'~"t~.
lfh, Pyfh
01)

~
An omega network is used in the NYU Ultracomputer, a massively parallel machine with up to 4096 processors, t,
connect the processors to the memory banks. This omega network has the property that the switches have small
buffers, enabling them to queue packets when a conflict occurs.

5-2
p.,_
Poo,

Mo,.
Mou

P,oo M,oo
P,o, M,.,

P110 ~==~--M,10
P11 1 M111
L __ _ , -- - . . __ _. --

Figure 24: Omega n etwork with P , connected to M 6

Mod-3

What is Memory Hierarchy?

The memory in a computer can be divided into five hierarchies based on the speed as well as use. The processor
move from one level to another based on its requirements. The five hierarchies in the memory are registers, cact
main memory, magnetic discs, and magnetic tapes. The first three hierarchies are volatile memories which mean
when there is no power, and then automatically they lose their stored data. Whereas the last two hierarchies are
volatile which means they store the data permanently.
A memory unit is the collection of storage units or devices together. The memory unit stores the binary informati
in the form of bits. Generally, memory/storage is classified into 2 categories:
Volatile Memory: This loses its data, when power is switched off.
Non-Volatile Memory: This is a permanent storage and does not lose any data when power is switched o·

Memory Hierarchy in Computer Architecture

Regisfer
Me!oory

lncreo~ng order of Cache

occe11 lime rolio Meroory

Main Meroory Primary Meroory

MogneticDiSIS
Auxiliary
Meroory
Magnetic Tapes
MEMORY HIERARCHY DESIGN

The memory hierarchy design in a computer system mainly includes different storage devices. Most of the
computers were inbuilt with extra storage to run more powerfully beyond the main memory capacity. The
following memory hierarchy diagram is a hierarchical pyramid for computer memory. The designing of the mem,
hierarchy is divided into two types such as primary (Internal) memory and secondary (External) memory.

Primary Memory
The primary memory is also known as internal memory, and this is accessible by the processor straightly. This
memory includes main, cache, as well as CPU registers.

Secondary Memory
The secondary memory is also known as external memory, and this is accessible by the processor through an
input/output module. This memory includes an optical disk, magnetic disk, and magnetic tape.
Difference between Vi rtual memo and Cache memory:

Virtual memory increases the capacity of main While cache memory increase the
1. memory. accessing speed of CPU.

2. Virtual memory is not a memory unit, its a technique. Cache memory is exactly a memory unit.

The size of virtual memory Is greater than the cache While the size of cache memory is less
3. memory. than the virtual memory.

On the other hand hardware manages

4. Operating System manages the Virtual memory. the cache memory.

In virtual memory, The program with size larger than While in cache memory, recently used
s. the main memory are executed. data Is copied Into.
"-'-~

~- - - - - - -- - 1?V"? b;J i~
~ ·_, - - - -- --------1--

· 1.wl 2 (7\ ~

~pi, 3 ~. ~-~

·W 4- (J\
' .
 -.... VVfft} Pljth
·On

o~:;:- o
cJA.SS,t,\A:te.

- -·----11- Gil c,~ ~;"o :~.;/ f~,te,, ::?" II, ~.J ,p,,,_,,,J ;"'
-- . !~ . Ji.,'.""'""' ~ ,, ~ ;,J.,, M, """"""o ,{-__

ii

11~ ,s ~ ~ Jlid ~ ~-~~~~ · ----

1-~~
,.... \
•

l-io'h :- A
 •

Uo-n ~

-;,ii