0% found this document useful (0 votes)
25 views2 pages

CCK Harvard Vs

The document summarizes the differences between the Harvard and Neumann computer architectures. The Harvard architecture suggests separate memory interfaces for data/variables and program/instructions, allowing instructions to be executed in parallel. While the Neumann architecture was simpler to implement, the Harvard architecture became more popular later due to its ability to execute more instructions within a given time period through parallel instruction execution.

Uploaded by

Tong Alan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
25 views2 pages

CCK Harvard Vs

The document summarizes the differences between the Harvard and Neumann computer architectures. The Harvard architecture suggests separate memory interfaces for data/variables and program/instructions, allowing instructions to be executed in parallel. While the Neumann architecture was simpler to implement, the Harvard architecture became more popular later due to its ability to execute more instructions within a given time period through parallel instruction execution.

Uploaded by

Tong Alan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Alan Tong 12wad06816 Harvard vs.

Neumann Architecture Harvard suggested a computer with two different memory interfaces, one for the data / variables and the other for program / instructions. Although Neumann architecture was accepted for simplicity and ease of implementation, Harvard architecture became popular later, due to the parallelism of instruction execution. Neumann Architecture (Single memory interface

Fig. 2.2

rinceton Architecture

!xample " An instruction #$ead a data byte from memory and store it in the accumulator# is executed as follows" % &ycle ' % $ead (nstruction &ycle 2 % $ead )ata out of $A* and put into Accumulator Harvard Architecture (Se!arate "rogram and #ata $emory interfaces

Fig. 2.+

Harvard Architecture

,he same instruction -as shown under Neumann Architecture. would be executed as follows" &ycle ' % &omplete previous instruction % $ead the #*ove )ata to Accumulator# instruction &ycle 2 % !xecute #*ove )ata to Accumulator# instruction % $ead next instruction

Hence each instruction is effectively executed in one instruction cycle, except for the ones that modify the content of the program counter. For example, the #/ump# -or call. instructions ta0es 2 cycles. ,hus, due to parallelism, Harvard architecture executes more instructions in a given time compared to Neumann Architecture.

You might also like