CS 4100 Course Outline Adapted from Prof D

  • Slides: 31
Download presentation
CS 4100: 計算機結構 Course Outline 國立清華大學資訊 程學系 九十三學年度第一學期 Adapted from Prof. D. Patterson’s class

CS 4100: 計算機結構 Course Outline 國立清華大學資訊 程學系 九十三學年度第一學期 Adapted from Prof. D. Patterson’s class notes Copyright 1998, 2000 UCB

有沒有電子開關? “gate” as the switch Outline-3 Computer Architecture C. T. King

有沒有電子開關? “gate” as the switch Outline-3 Computer Architecture C. T. King

A Working Transistor (1/5) t Transistors consist of three terminals; the source, the gate,

A Working Transistor (1/5) t Transistors consist of three terminals; the source, the gate, and the drain: Outline-4 Computer Architecture C. T. King

A Working Transistor (2/5) t In the n-type transistor, both the source and the

A Working Transistor (2/5) t In the n-type transistor, both the source and the drain are negatively-charged and sit on a positively-charged well of p-silicon. Outline-5 Computer Architecture C. T. King

A Working Transistor (3/5) t When positive voltage is applied to the gate, electrons

A Working Transistor (3/5) t When positive voltage is applied to the gate, electrons in the p-silicon are attracted to the area under the gate forming an electron channel between the source and the drain. Outline-6 Computer Architecture C. T. King

A Working Transistor (4/5) t When positive voltage is applied to the drain, the

A Working Transistor (4/5) t When positive voltage is applied to the drain, the electrons are pulled from the source to the drain. In this state the transistor is on. 開 Outline-7 Computer Architecture C. T. King

A Working Transistor (5/5) t If the voltage at the gate is removed, electrons

A Working Transistor (5/5) t If the voltage at the gate is removed, electrons are not attracted to the area between the source and drain. The pathway is broken and the transistor is turned off. 關 Outline-8 Computer Architecture C. T. King

有了開關就可以做邏輯閘 t CMOS NAND: Outline-10 Computer Architecture C. T. King

有了開關就可以做邏輯閘 t CMOS NAND: Outline-10 Computer Architecture C. T. King

有了邏輯閘就可做邏輯電路 t 加法器: Outline-11 Computer Architecture C. T. King

有了邏輯閘就可做邏輯電路 t 加法器: Outline-11 Computer Architecture C. T. King

也可以做記憶元件 t 可存一個bit的東西: R R' Q clock' Q' S' S Outline-12 Computer Architecture C.

也可以做記憶元件 t 可存一個bit的東西: R R' Q clock' Q' S' S Outline-12 Computer Architecture C. T. King

這部份的學問叫____ 答:「數位邏輯設計」 Outline-13 Computer Architecture C. T. King

這部份的學問叫____ 答:「數位邏輯設計」 Outline-13 Computer Architecture C. T. King

Basic Organization of Any Computer Devices Keyboard, Mouse Input Disk Computer Processor (active) Control

Basic Organization of Any Computer Devices Keyboard, Mouse Input Disk Computer Processor (active) Control (“brain”) Datapath (“brawn”) Memory (passive) (where programs, data live when running) Output (where programs, data live when not running) Display, Printer Outline-15 Computer Architecture C. T. King

Computer Organization t t t Capabilities and performance characteristics of principal functional units, e.

Computer Organization t t t Capabilities and performance characteristics of principal functional units, e. g. , registers, ALU, shifters, . . . Ways in which these components are interconnected (structure) Information flows between components (data, datapath) Logic and means by which such information flow is controlled Register Transfer Level (RTL) description Outline-16 Computer Architecture C. T. King

What is Computer Architecture? Application (IE) Compiler Software Hardware Assembler Operating System (MS Windows)

What is Computer Architecture? Application (IE) Compiler Software Hardware Assembler Operating System (MS Windows) Processor Memory I/O system Instruction Set Architecture Datapath & Control Digital Design Circuit Design Transistors Machine Organization Computer Architecture = Instruction Set Architecture + Machine Organization Outline-17 Computer Architecture C. T. King

Instruction Set as an Interface software instruction set hardware Does it have to be

Instruction Set as an Interface software instruction set hardware Does it have to be hardware? t Coordination of many levels of abstraction Outline-18 Computer Architecture C. T. King

Another Perspective temp = v[k]; High Level Language Program v[k] = v[k+1]; v[k+1] =

Another Perspective temp = v[k]; High Level Language Program v[k] = v[k+1]; v[k+1] = temp; Compiler lw lw sw sw Assembly Language Program ISA Assembler Machine Language Program Machine Interpretation Control Signal Specification ° ° 0000 1010 1100 0101 1001 1111 0110 1000 1100 0101 1010 0000 $15, $16, $15, 0110 1000 1111 1001 1010 0000 0101 1100 0($2) 4($2) 1111 1000 0110 0101 1100 0000 1010 1000 0110 1001 1111 ALUOP[0: 3] <= Inst. Reg[9: 11] & MASK Outline-19 Computer Architecture C. T. King

Instruction Set Architecture (ISA) “. . . the attributes of a [computing] system as

Instruction Set Architecture (ISA) “. . . 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 m Organization of Programmable Storage m Data Types and Data Structures: Encodings and Representations m Instruction Set m Instruction Formats m Modes of Addressing and Accessing Data Items and Instructions m Exceptional Conditions SOFTWARE Outline-20 Computer Architecture C. T. King

MIPS R 3000 ISA t Registers Instruction categories: l l Load/Store Computational Jump and

MIPS R 3000 ISA t Registers Instruction categories: l l Load/Store Computational Jump and Branch Floating Point n l l R 0 - R 31 coprocessor PC HI Memory Management Special LO 3 Instruction Formats: all 32 bits wide OP rs rt OP rd sa funct immediate jump target Outline-21 Computer Architecture C. T. King

Example ISA Digital Alpha (v 1, v 3) 1992 -97 HP PA-RISC (v 1.

Example ISA Digital Alpha (v 1, v 3) 1992 -97 HP PA-RISC (v 1. 1, v 2. 0) 1986 -96 Sun Sparc (v 8, v 9) 1987 -95 SGI MIPS (MIPS I, III, IV, V) 1986 -96 Intel (8086, 80286, 80386, 197880486, Pentium, MMX, SIMD, IA-64, . . . ) Outline-22 Computer Architecture C. T. King

Why Do Computer Architecture? t t RAPID CHANGES It is exciting! It has never

Why Do Computer Architecture? t t RAPID CHANGES It is exciting! It has never been more exciting! It impacts every other aspect of electrical engineering and computer science Outline-23 Computer Architecture C. T. King

Course Administration: CS 4100 -01 t t t 授課老師: 金仲達 l 辦公室: 資電 443

Course Administration: CS 4100 -01 t t t 授課老師: 金仲達 l 辦公室: 資電 443 電話: 2804 email: king@cs. nthu. edu. tw 助教: (參考課程網頁) l CS 4100 -01: 林旻平 上課時間: l CS 4100 -01: 星期二10: 10 -12: 00 星期四 10: 10 -11: 00 上課地點: 資電館 127室 課程網頁: http: //www. cs. nthu. edu. tw/~king/courses/cs 4100. html Outline-24 Computer Architecture C. T. King

Course Administration: CS 4100 -02 t t t 授課老師: 黃婷婷 l 辦公室: 資電 442

Course Administration: CS 4100 -02 t t t 授課老師: 黃婷婷 l 辦公室: 資電 442 電話: 1310 email: ting@cs. nthu. edu. tw 助教: (參考課程網頁) l CS 4100 -02: to be announced 上課時間: l CS 4100 -02: 星期二10: 10 -12: 00 星期四 10: 10 -11: 00 上課地點: 資電館 131室 課程網頁: http: //www. cs. nthu. edu. tw/~ting/cs 4100. html Outline-25 Computer Architecture C. T. King

Text Book Computer Organization and Design: The Hardware/Software Interface, 2 nd ed. , David

Text Book Computer Organization and Design: The Hardware/Software Interface, 2 nd ed. , David Patterson and John Hennessy, 1998 RISC, RAID 學 大 福 丹 史 校長 Outline-26 Computer Architecture C. T. King

Topics Covered Computer Organization and Design: The Hardware/Software Interface, 2 nd ed. , D.

Topics Covered Computer Organization and Design: The Hardware/Software Interface, 2 nd ed. , D. Patterson and J. Hennessy, 1998 Topic Introduction The Role of Performance Instructions: Language of the Machine Arithmetic for Computers The Processor: Datapath and Control Enhancing Performance with Pipelining Exploiting Memory Hierarchy Interfacing Processors and Peripherals Outline-27 Chapter 1 2 3 4 5 6 7 8 Computer Architecture C. T. King

Prerequisite t Prerequisite courses: l t Basic machine structure l t t t MIPS

Prerequisite t Prerequisite courses: l t Basic machine structure l t t t MIPS preferred Understand the concept of virtual memory Logic design l t Processor, memory, I/O Read and write basic C programs Read and write in an assembly language l t Logic design, assembly language and system programming Logic equations, schematic diagrams, finite state machine Account on the CS workstations Outline-28 Computer Architecture C. T. King

Expected Course Workload t t t Learn MIPS instruction set Learn processor emulators and

Expected Course Workload t t t Learn MIPS instruction set Learn processor emulators and benchmarking 6 homework assignments (1 per 2 weeks) l l l t t Each assignment is a mixture of design, calculation, programming, measurement, and discussion problems Assignments will be posted on the course homepage Independent of, but complement, examinations One mid-term and one final examination Grade breakdown l l l Homework Assignments Midterm Exam: Final Exam: Outline-29 35% 30% 35% (11/9/2004) (1/6/2005) Computer Architecture C. T. King

Course Problems t Cannot turn in homework on time l t Forgot to turn

Course Problems t Cannot turn in homework on time l t Forgot to turn in homework/ Dog ate computer l t No late homework is accepted ? ? ? What is cheating? l l Study together in groups is encouraged Work must be your own Outline-30 Computer Architecture C. T. King