1. Lecture 1 CS147 Prof. Sin-Min Lee Department of Computer Science
San Jose State University

2. Tuesday Thursday
10:15 – 11:30

3. Your evaluation in this course is determined by:
30%
15%
Class Presentation %
Presentation report %
Final Exam %

4. Midterm 1: Sept. 11
Midterm 2: Oct 4 Midterm 3: Nov. 1

9. Text Book
M. Murdocca and V. Heuring, Computer Architecture and Organization, an integrated approach,Wiley, 2007.

10. 2nd edition, Jones and Bartlett Publishers ,2006.
Good REFERENCE
Linda Null and Julia Lobur, The Essentials Of Computer Organization and Architecture,
2nd edition, Jones and Bartlett Publishers ,2006.
ISBN

11.   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. 

16. 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

17. 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

26. 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
SOFTWARE

27. 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

28. 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.
Based on the way humans appear to work. All computers prior to this date had their programs in the wires. Only the data changed their function did not.

29. Von Neumann Architecture
CONTROL
INPUT
MEMORY
OUTPUT
Data
Clearly fits in with the requirements of data processing machines. (Computers)
Serial , Parallel
Computer buses are parallel each bit in the binary word gets its own wire.
A.L.U
Control
Address
INPUT > PROCESS >OUTPUT

30. 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 Course Design of CPU, memory system, I/O system, Multiprocessors. (All evolving at a tremendous rate!)

31. Structure of von Neumann machine

32. IAS - details 1000 x 40 bit words Set of registers (storage in CPU)
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

33. 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

37. 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..

39. } } } } } Binary Digits (Bits) Only 2 states possible Off On On 1 Off
Human readable
symbols On 1
Off
Only 2
states possible
Inside the
computer’s
memory (RAM) }
Electronic
pulse present
pulse absent
Permanently
stored on
disks }
Positive
magnetic
field
Negative
Off
Permanently
stored on
CD-ROM }
Pitted
Not On
Fiber
Optic
Cable }
Light Pulse
No Light Pulse

43. Chapter 1. Number Base

50. Born: 1786 in Bristol, England Died: 22 Sept 1837 in Bath, England
William George Horner
Born: 1786 in Bristol, England Died: 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.

52. 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 “
F Cajori, Horner's Method of Approximation Anticipated by Ruffini, Bull. Amer. Math. Soc. 17 (1911),

53. 霍納法
　　「霍納法」（Horner's method）是求 高次方程的近似值的一種方法，在1819年，英國數學家霍納（ ）於英國皇家 學會宣讀了論文「用連續迫近方法解所有的數字方程的新方法」，從中提出了霍納法。 這與中國著名數學家秦九韶熟練運用的「增乘開方法」（1247）實質上是一致的，但比 中國遲五至六百年。因此，霍納法又可稱為秦九韶法。