Lecture 1

Prof. Sin-Min Lee

Department of Computer Science

San Jose State University

Tuesday Thursday

10:15 – 11:30

Your evaluation in this course is determined by:

30%

15%

Class Presentation 10%

Presentation report 5%

Final Exam 30%

Midterm 1: ?????

Midterm 2: ???? Midterm 3: ????

???Sometimes

Text Book

Computer Systems Architecture: A Networking Approach

Author: Rob WilliamsFormat: PaperbackPublication Date: November 2006Publisher: Prentice Hall

1. M. Murdocca and V. Heuring, Computer Architecture and Organization, an integrated approach,Wiley, 2007.2. Linda Null and Julia Lobur, The Essentials Of Computer Organization and Architecture,

2nd edition, Jones and Bartlett Publishers ,2006.

ISBN -10-7637-3769-0

Good REFERENCEs

  The text covers such topics as digital logic, data representation, machine-level language, general organization, assembly language programming, CPU organization, memory organization, and input/output devices, as well as a new chapter on Embedded Systems. 

ENIAC - background

• Electronic Numerical Integrator And Computer• Eckert and Mauchly• University of Pennsylvania• Trajectory tables for weapons • Started 1943• Finished 1946

– Too late for war effort

• Used until 1955

ENIAC - details

• Decimal (not binary)• 20 accumulators of 10 digits• Programmed manually by switches• 18,000 vacuum tubes• 30 tons• 15,000 square feet• 140 kW power consumption• 5,000 additions per second

What’s Computer Architecture?

The attributes of a [computing] system as seen by the programmer, i.e., the conceptual structure and functional behavior, as distinct from the organization of the data flows and controls the logic design, and the physical implementation.

Amdahl, Blaaw, and Brooks, 1964

SOFTWARESOFTWARE

von Neumann/Turing

• Stored Program concept• Main memory storing programs and data• ALU operating on binary data• Control unit interpreting instructions from memory

and executing• Input and output equipment operated by control unit• Princeton Institute for Advanced Studies

– IAS

• Completed 1952

Von Neumann Model

• 1940’s a new model for building computers.

• Today we can still see the effect.

• Radically different from what went before. – The memory of the computer was to store both

the data to be worked on and the program doing the work.

– The stored program computer concept.

Von Neumann Architecture

A.L.U

INPUT OUTPUTMEMORY

Data Control

INPUT > PROCESS >OUTPUT

CONTROL

Address

What’s Computer Architecture?

• 1950s to 1960s: Computer Architecture Course Computer Arithmetic.

• 1970s to mid 1980s: Computer Architecture Course Instruction Set Design, especially ISA appropriate for compilers. (What we’ll do in Chapter 2)

• 1990s to 2000s: Computer Architecture CourseDesign of CPU, memory system, I/O system, Multiprocessors. (All evolving at a tremendous rate!)

Structure of von Neumann machine

IAS - details

• 1000 x 40 bit words– Binary number– 2 x 20 bit instructions

• Set of registers (storage in CPU)– Memory Buffer Register– Memory Address Register– Instruction Register– Instruction Buffer Register– Program Counter– Accumulator– Multiplier Quotient

Commercial Computers

• 1947 - Eckert-Mauchly Computer Corporation• UNIVAC I (Universal Automatic Computer)• US Bureau of Census 1950 calculations• Became part of Sperry-Rand Corporation• Late 1950s - UNIVAC II

– Faster

– More memory

Gordon Moore (co-founder of Intel) predicted in 1965 that the transistor density of semiconductor chips would double roughly every 18 months.

Moore's Law, formulated by Gordon Moore in 1965, three years before he helped found chip maker Intel Corp..

Binary Digits (Bits)

Only 2states

possible

On Off

Fiber Optic Cable}Light

PulseNo Light

Pulse

Permanentlystored onCD-ROM}Pitted

NotPitted

Inside thecomputer’s

memory (RAM)

}Electronic

pulse present

Electronicpulse

absent

Permanentlystored on

disks}Positive magnetic

field

Negative magnetic

field

} Human readable symbols

On1

Off0

Chapter 1. Number Base

William George Horner

Born: 1786 in Bristol, EnglandDied: 22 Sept 1837 in Bath, England

Horner's only significant contribution to mathematics was Horner's method for solving algebraic equations. It was submitted to the Royal Society on 1 July 1819 and was

published in the same year in the Philosophical Transactions of the Royal Society.

Some years earlier Ruffini had described a similar method which had won him the gold medal offered by the

Italian Mathematical Society for Science who had asked for improved methods for numerical solutions to equations.

However neither Ruffini nor Horner was the first to discover this method as it was known to Zhu Shijie 500

years earlier.

Ch'in Chiu-Shao is a thirteenth century Chinese sage who around 1247 AD composed the nine sections of mathematics. He also developed a scheme for the solution of numerical equations.

The difference between Ch'in Chiu-Shao and Horner's is that Ch'in Chiu-Shao uses Horner's method of synthetic division in reverse order

No one noticed that the Chinese had this knowledge for a long time until Wang Ling and Joseph Needham's paper on

1. "Horner's Method in Chinese Mathematics “

2. F Cajori, Horner's Method of Approximation Anticipated by Ruffini, Bull. Amer. Math. Soc. 17 (1911), 409-414.

霍納法

　 　 「霍納法」（ Horner's　method 　）是求 高次方程的近似值的一種方法，在 1819年，英國數學家霍納（ 1786-1837 　）於英國皇家 學會宣讀了論文「用連續迫近方法解所有的數字方程的新方法」，從中提出了霍納

　法。 這與中國著名數學家秦九韶熟練運用的「增乘開方法」（ 1247 　）實質上是一致的，但比 中國遲五至六百年。因此，霍納法又可稱為秦九韶法。