0% found this document useful (0 votes)
9 views30 pages

Lecture 4

computer university lessons
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views30 pages

Lecture 4

computer university lessons
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 30

Chapter 2:

Data Manipulation

Computer Science: An Overview


Tenth Edition

by
J. Glenn Brookshear

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


Computer Architecture

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


Computer Architecture

• Central Processing Unit (CPU) or


processor
– Arithmetic/Logic unit versus Control unit
– Registers
• General purpose
• Special purpose
• Bus
• Motherboard

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


3
Figure 2.1 CPU and main memory
connected via a bus

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


4
Videos

https://www.youtube.com/watch?v=ZoA8kH
mp7do

https://www.youtube.com/watch?v=b2pd3Y6
aBag

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


Stored Program Concept

A program can be encoded as bit patterns


and stored in main memory. From there,
the CPU can then extract the instructions
and execute them.

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


6
Terminology

• Machine instruction: An instruction (or


command) encoded as a bit pattern
recognizable by the CPU
• Machine language: The set of all
instructions recognized by a machine

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


7
Machine Instruction Types

• Data Transfer: copy data from one location


to another
• Arithmetic/Logic: use existing bit patterns
to compute a new bit patterns
• Control: direct the execution of the
program

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


8
Figure 2.2 Adding values stored in
memory

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


9
Figure 2.3 Dividing values stored in
memory

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


10
Parts of a Machine Instruction

• Op-code: Specifies which operation to


execute
• Operand: Gives more detailed information
about the operation
– Interpretation of operand varies depending on
op-code

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


11
Figure 2.5 The composition of an
instruction for the machine in
Appendix C

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


12
Figure 2.6 Decoding the instruction
35A7

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


13
Program Execution

• Controlled by two special-purpose registers


– Program counter: address of next instruction
– Instruction register: current instruction
• Machine Cycle
– Fetch
– Decode
– Execute

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


14
Figure 2.8 The machine cycle

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


15
Figure 2.9 Decoding the instruction
B258

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


16
Figure 2.10 The program from Figure 2.7
stored in main memory ready for execution

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


17
Figure 2.11 Performing the fetch step
of the machine cycle

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


18
Figure 2.11 Performing the fetch step
of the machine cycle (cont’d)

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


19
Arithmetic/Logic Operations

• Logic: AND, OR, XOR


– Masking
• Rotate and Shift: circular shift, logical shift,
arithmetic shift
• Arithmetic: add, subtract, multiply, divide
– Precise action depends on how the values are
encoded (two’s complement versus
floating-point).

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


20
And, Or, Xor

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


Masking
Consider, for example, what
happens if the byte 00001111 is the
first operand of an AND operation.
This use of the AND operation is an
example of the process called
masking.
Here one operand, called a mask,
determines which part of the other
operand will affect the result.

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


Masking

Whereas the mask 11011111


can be used with the AND
operation to force a 0 in the
third bit from the high-order
end of a byte, the mask
00100000 can be used with
the OR operation to force a 1
in that position.

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


XOR

A major use of the XOR operation is in forming the


complement of a bit string.
XORing any byte with a mask of all 1s produces the
complement of the byte.
For example, note the relationship between the second
operand and the result in the following example:x

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


Figure 2.12 Rotating the bit pattern
65 (hexadecimal) one bit to the right

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


25
Communicating with Other Devices
• Controller: An intermediary apparatus that
handles communication between the computer
and a device
– Specialized controllers for each type of device
– General purpose controllers (USB and
FireWire)
• Port: The point at which a device connects to a
computer
• Memory-mapped I/O: CPU communicates with
peripheral devices as though they were memory
cells

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


26
Figure 2.13 Controllers attached to a
machine’s bus

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


27
Figure 2.14 A conceptual representation
of memory-mapped I/O

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


28
Communicating with Other Devices
(continued)

• Direct memory access (DMA): Main


memory access by a controller over the
bus
• Von Neumann Bottleneck: Insufficient
bus speed impedes performance
• Handshaking: The process of
coordinating the transfer of data between
components

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


29
Data Communication Rates

• Measurement units
– Bps: Bits per second
– Kbps: Kilo-bps (1,000 bps)
– Mbps: Mega-bps (1,000,000 bps)
– Gbps: Giga-bps (1,000,000,000 bps)
• Bandwidth: Maximum available rate

Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley


30

You might also like