CSE 243: Introduction to Computer Architecture

and Hardware/Software Interface

Topics covered:
Course outline and schedule
Introduction
 General information

CSE 243 : Introduction to Computer Architecture and Hardware

/Software Interface.
Instructor : Swapna S. Gokhale
Phone : 6-2772.
Email : [email protected]
Office : UTEB 468
Lecture time : TuTh 2:00pm – 3:15 pm.
Office hours : By appointment.
(I will hang around for a few minutes at the end of
each class).
Web page : http://www.engr.uconn.edu/~ssg/cse243.html
(Lecture notes, homeworks, homework solutions etc.
will be posted on the web page)
TA : Tobias Wolfertshofer
Email : [email protected]
Office hours : Discuss with the TA

2
 Course Objective

Describe the general organization and architecture of computers.

Identify computers’ major components and study their functions.
Introduce hardware design issues of modern computer architectures.
Build the required skills to read and research the current literature in
computer architecture.
Learn assembly language programming.

3
 Textbooks

•“Computer Organization,” by Carl Hamacher, Zvonko Vranesic and

Safwat Zaky. Fifth Edition McGraw-Hill, 2002.

•“SPARC Architecture, Assembly Language Programming and C,” Richard

P. Paul, Prentice Hall, 2000.

4
 Course topics

1. Introduction (Chapter 1): Basic concepts, overall organization.

2. Addressing methods (Chapter 2): fetch/execute cycle, basic
addressing modes, instruction sequencing, assembly language and
stacks. CISC vs. RISC architectures.
3. Examples of ISAs (Chapter 3): 68000 instruction set architecture
and ARM instruction set architecture
4. CPU architecture (Chapter 7): Single-bus CPU, Multiple-bus CPU
Hardware control, and Microprogrammed control.
5. Arithmetic (Chapter 6): Integer arithmetic and floating-point
arithmetic.
6. Memory architecture (Chapter 5): Memory hierarchy, Primary
memory, Cache memory, virtual memory.
7. Input/Output organization (Chapter 4): I/O device addressing, I/O
data transfers, Synchronization, DMA, Interrupts, Channels, Bus
transfers, and Interfacing.
8. I/O Devices (Chapter 5): Disk systems.

5
Grading System

Exam #1: (8%)

- Addressing methods, CISC and RISC architectures.
Exam #2 (8%)
- CPU Architecture
Exam #3 (8%)
- Arithmetic
Exam #4 (8%)
- Memory architecture.
Final (28%)
- All topics.
Homework assignments (15%)
- 4 homework assignments.
Lab Assignments/Projects (25%)

6
 Course topics, exams and assignment calendar
Week #1 (Jan 27):
- Addressing methods.
Week #2 (Feb 3):
- Instruction Set Architectures of 68000 and ARM processors.
- Assignment #1 handed out.
Week #3 (Feb 10):
- Problem solving -- assembly language programming.
- CPU Architecture.
Week #4 (Feb 17):
- CPU Architecture.
- Assignment #1 due, Assignment #2 handed out.
- Exam #1 (Addressing modes, etc.).
Week #5 (Feb 24)
- CPU Architecture.
Week #6 (March 3)
- Arithmetic.
- Assignment #2 due, Assignment #3 handed out.
- Exam #2 (CPU Architecture)

7
 Course topics, exams and assignment calendar

Week #7 (March 10):

- Arithmetic
Week #8 (March 24):
- Memory architecture.
- Assignment #3 due.
- Exam #3 (arithmetic).
Week #9 (March 31):
- Memory architecture.
- Assignment #4 handed out.
Week #10 (April 7):
- Memory organization
- I/O organization.
Week #11 (April 14):
- I/O organization.
- Assignment #4 due.
- Exam #4 (Memory architecture).

8
 Course topics, exams and assignment calendar

Week #12 (April 21):

- I/O organization
- I/O devices.
Week #13 (April 28)
- Disk systems
- Pipelining
Week #14: (May 5)
- Pipelining

9
 Grading policy

•Refer to the University policy regarding Student Conduct (Plagiarism, etc.)

•Grading of assignments/exams is handled by the TA, if you cannot resolve
a problem with the TA, see me.
•Assignments may be submitted by email. Hard copy will also be accepted,
but you have to submit in the department office to stamp the date. Please
submit all the assignments to the TA.
• Late assignments are penalized by a loss of 33% per day late (so 3 days late
is as late as you can get). Solution will be posted on the course web page
No assignments will be accepted after the solution is posted.
•The weeks during which exams will be held have been announced. The actual
day of that week, (Tuesday or Thursday) when the exam will be held will be
announced two weeks prior to the exam. It will be also posted on the course
web page at the same time.
If you have any conflict with the exam date, please see me in advance.

10
 Important prerequisite material

•CSE 207/208 is fundamental to CSE 243.

•Review issues in:
- Basic computer organization: CPU, Memory, I/O, Registers.
- Fundamentals of combinatorial design and sequential design.
- Simple ALU, simple register design.

11
 Reading

•Reading the text is imperative.

•Computer architecture especially processor design, changes rapidly.
You really have to keep up with the changes in the industry. This is
especially important for job interviews later.

12
 Labs

•Lab times (as per catalog) are not fixed. Work can be done outside of
scheduled lab hours. But expect to spend at least the time allotted in
the lab.
•Lab assignments will involve tkisem. tkisem is a tool from University
of New Mexico. Information can be found at:
http://www.cs.unm.edu/~maccabe/tkisem/begin.html
•tkisem is a Tcl/Tk version of isem (Instructional Sparc Emulator).
•tkisem involves assembly language programming.
•If you have PC (Mac running virtual PC) you can install tkisem on your
own machines. Otherwise tkisem will be in the learning center.
•Lab assignments should be submitted electronically to the TA.

13
 Feedback

Please provide informal feedback early and often, before the formal
review process.

14
 What is a computer?

 Simply put, a computer is a sophisticated electronic

calculating machine that:
 Accepts input information,
 Processes the information according to a list of
internally stored instructions and
 Produces the resulting output information.
 Functions performed by a computer are:
 Accepting information to be processed as input.
 Storing a list of instructions to process the information.
 Processing the information according to the list of
instructions.
 Providing the results of the processing as output.
 What are the functional units of a computer?

15
 Functional units of a computer
Input unit accepts Arithmetic and logic unit(ALU):
information: •Performs the desired
•Human operators, operations on the input
•Electromechanical devices information as determined
•Other computers by instructions in the memory

Memory
Arithmetic
Input
Instr1 & Logic
Instr2
Instr3
Data1
Output Data2 Control

I/O Processor
Stores
information: Control unit coordinates
Output unit sends various actions
results of processing: •Instructions,
•Data •Input,
•To a monitor display, •Output
•To a printer •Processing

16
 Information in a computer -- Instructions

 Instructions specify commands to:

 Transfer information within a computer (e.g., from memory to
ALU)
 Transfer of information between the computer and I/O devices
(e.g., from keyboard to computer, or computer to printer)
 Perform arithmetic and logic operations (e.g., Add two
numbers, Perform a logical AND).
 A sequence of instructions to perform a task is called a
program, which is stored in the memory.
 Processor fetches instructions that make up a program from
the memory and performs the operations stated in those
instructions.
 What do the instructions operate upon?

17
 Information in a computer -- Data

 Data are the “operands” upon which instructions operate.

 Data could be:
 Numbers,
 Encoded characters.
 Data, in a broad sense means any digital information.
 Computers use data that is encoded as a string of binary
digits called bits.

18
 Input unit
Binary information must be presented to a computer in a specific format. This
task is performed by the input unit:
- Interfaces with input devices.
- Accepts binary information from the input devices.
- Presents this binary information in a format expected by the computer.
- Transfers this information to the memory or processor.
Real world Computer

Memory

Keyboard
Audio input
Input Unit
……

Processor

19
 Memory unit

 Memory unit stores instructions and data.

 Recall, data is represented as a series of bits.
 To store data, memory unit thus stores bits.
 Processor reads instructions and reads/writes data from/to
the memory during the execution of a program.
 In theory, instructions and data could be fetched one bit at a
time.
 In practice, a group of bits is fetched at a time.
 Group of bits stored or retrieved at a time is termed as “word”
 Number of bits in a word is termed as the “word length” of a
computer.
 In order to read/write to and from memory, a processor
should know where to look:
 “Address” is associated with each word location.

20
 Memory unit (contd..)
 Processor reads/writes to/from memory based on the
memory address:
 Access any word location in a short and fixed amount of time
based on the address.
 Random Access Memory (RAM) provides fixed access time
independent of the location of the word.
 Access time is known as “Memory Access Time”.

 Memory and processor have to “communicate” with each

other in order to read/write information.
 In order to reduce “communication time”, a small amount of
RAM (known as Cache) is tightly coupled with the processor.
 Modern computers have three to four levels of RAM units with
different speeds and sizes:
 Fastest, smallest known as Cache
 Slowest, largest known as Main memory.

21
 Memory unit (contd..)

 Primary storage of the computer consists of RAM units.

 Fastest, smallest unit is Cache.
 Slowest, largest unit is Main Memory.

 Primary storage is insufficient to store large amounts of

data and programs.
 Primary storage can be added, but it is expensive.
 Store large amounts of data on secondary storage devices:
 Magnetic disks and tapes,
 Optical disks (CD-ROMS).
 Access to the data stored in secondary storage in slower, but
take advantage of the fact that some information may be
accessed infrequently.
 Cost of a memory unit depends on its access time, lesser
access time implies higher cost.

22
 Arithmetic and logic unit (ALU)

 Operations are executed in the Arithmetic and Logic Unit

(ALU).
 Arithmetic operations such as addition, subtraction.
 Logic operations such as comparison of numbers.
 In order to execute an instruction, operands need to be
brought into the ALU from the memory.
 Operands are stored in general purpose registers available in
the ALU.
 Access times of general purpose registers are faster than the
cache.
 Results of the operations are stored back in the memory or
retained in the processor for immediate use.

23
 Output unit
•Computers represent information in a specific binary form. Output units:
- Interface with output devices.
- Accept processed results provided by the computer in specific binary form.
- Convert the information in binary form to a form understood by an
output device.

Computer Real world

Memory Printer
Graphics display
Speakers
……
Output Unit

Processor

24
 Control unit

 Operation of a computer can be summarized as:

 Accepts information from the input units (Input unit).
 Stores the information (Memory).
 Processes the information (ALU).
 Provides processed results through the output units (Output
unit).
 Operations of Input unit, Memory, ALU and Output unit are
coordinated by Control unit.
 Instructions control “what” operations take place (e.g. data
transfer, processing).
 Control unit generates timing signals which determines
“when” a particular operation takes place.

25
 How are the functional units connected?

•For a computer to achieve its operation, the functional units need to

communicate with each other.
•In order to communicate, they need to be connected.

Input Output Memory Processor

Bus

•Functional units may be connected by a group of parallel wires.

•The group of parallel wires is called a bus.
•Each wire in a bus can transfer one bit of information.
•The number of parallel wires in a bus is equal to the word length of
a computer

26
Organization of cache and main memory

Main Cache
memory memory Processor

Bus

Why is the access time of the cache memory lesser than the
access time of the main memory?

27