《现代计算机体系结构》课程教学课件(留学生版)Lecture 1 Instruction Set Architecture(Introduction)

Computer ArchitectureInstruction Set Architecture(Introduction)ComputerArchitecture
Computer Architecture Computer Architecture Instruc1on Set Architecture (Introduc1on)

What is A Computer?. Three key componentsComputationCommunicationStorage (memory)ComputingSystemComputingCommunicationMemory/StorageUnitUnitUnitMemorySystemStorageSystemComputerArchitecture
Computer Architecture What is A Computer? • Three key components • Computation • Communication • Storage (memory) 2

What isAComputer?: We will cover all three componentsProcessingMemorycontrol1/0(program(sequencing)and data)datapathComputerArchitecture
Computer Architecture What is A Computer? • We will cover all three components 3 Memory (program and data) I/O Processing control (sequencing) datapath

TheVonNeumannModel/Architecture: Also called stored program computer (instructionsin memory). Two key properties::Stored programInstructionsstoredinalinearmemoryarray-Memoryis unified betweeninstructions anddataTheinterpretationofastoredvaluedependsonthecontrolsignalsWhen is a value interpreted as an instruction?:Sequential instruction processingOne instruction processed (fetched, executed, and completed) at atime-Program counter (instruction pointer) identifies the current instr.ProgramcounterisadvancedsequentiallyexceptforcontroltransferinstructionsComputerArchitecture
Computer Architecture The Von Neumann Model/Architecture • Also called stored program computer (instructions in memory). Two key properties: • Stored program – Instructions stored in a linear memory array – Memory is unified between instructions and data • The interpretation of a stored value depends on the control signals • Sequential instruction processing – One instruction processed (fetched, executed, and completed) at a time – Program counter (instruction pointer) identifies the current instr. – Program counter is advanced sequentially except for control transfer instructions 4 When is a value interpreted as an instruction?

The Von-Neumann Model (of a Computer)MEMORYMemAddrRegMemDataRegPROCESSINGUNITINPUTOUTPUTTEMPALUCONTROLUNITIPInstRegisterComputerArchitecture
Computer Architecture The Von-Neumann Model (of a Computer) 5 CONTROL UNIT IP Inst Register PROCESSING UNIT ALU TEMP MEMORY Mem Addr Reg Mem Data Reg INPUT OUTPUT

Aside:Dataflow Model (of a Computer). Von Neumann model: An instruction is fetched andexecuted in control flow order- As specified by the instruction pointer- Sequential unless explicit control flow instructionDataflow model: An instruction is fetched and executedin data flow order- i.e., when its operands are ready- i.e., there is no instruction pointer- Instruction ordering specified by data flow dependence·Each instruction specifies"who"should receive the result.An instruction can"fire"whenever all operands are received- Potentially many instructions can execute at the same time·Inherentlymore parallelComputerArchitecture
Computer Architecture Aside: Dataflow Model (of a Computer) • Von Neumann model: An instruction is fetched and executed in control flow order – As specified by the instruction pointer – Sequential unless explicit control flow instruction • Dataflow model: An instruction is fetched and executed in data flow order – i.e., when its operands are ready – i.e., there is no instruction pointer – Instruction ordering specified by data flow dependence • Each instruction specifies “who” should receive the result • An instruction can “fire” whenever all operands are received – Potentially many instructions can execute at the same time • Inherently more parallel 6

Aside:vonNeumannvsDataflow. Consider a von Neumann program-What is the significance of the program order?-What isthesignificanceofthe storagelocations?abv<=a + b;w <= b * 2;X<=V- Wy<=v+wz <=x*ySequentialDataflowZWhich model is more natural to you as a programmer?ComputerArchitecture
Computer Architecture Aside: von Neumann vs Dataflow • Consider a von Neumann program – What is the significance of the program order? – What is the significance of the storage locaJons? • Which model is more natural to you as a programmer? 7 v <= a + b; w <= b * 2; x <= v - w y <= v + w z <= x * y + *2 - + * a b z Sequential Dataflow

Aside:MoreonDataFlow: In a data flow machine, a program consists of dataflow nodes- A data flow node fires (fetched and executed) when all itinputs are ready. i.e. when all inputs have tokens: Data flow node and its ISA representation*RARG1RARG2Dest.OfResultComputerArchitecture
Computer Architecture Aside: More on Data Flow • In a data flow machine, a program consists of data flow nodes – A data flow node fires (fetched and executed) when all it inputs are ready • i.e. when all inputs have tokens • Data flow node and its ISA representation 8

Aside:ISA-levelTradeoff:Instruction Pointer. Do we need an instruction pointer in the ISA?- Yes: Control-driven, sequential execution.An instructionisexecuted whentheIP pointstoit. IP automatically changes sequentially (except for control flowinstructions)- No: Data-driven, parallel execution:An instruction is executed when all its operandvalues areavailable (data flow): Tradeoffs: MANY high-level ones- Ease of programming (for average programmers)?-Easeofcompilation?-Performance:Extraction ofparallelism?Hardwarecomplexity?ComputerArchitecture
Computer Architecture Aside: ISA-level Tradeoff: InstrucJon Pointer • Do we need an instruction pointer in the ISA? – Yes: Control-driven, sequential execution • An instruction is executed when the IP points to it • IP automatically changes sequentially (except for control flow instructions) – No: Data-driven, parallel execution • An instruction is executed when all its operand values are available (data flow) • Tradeoffs: MANY high-level ones – Ease of programming (for average programmers)? – Ease of compilation? – Performance: Extraction of parallelism? – Hardware complexity? 9

ISA vs. Microarchitecture Level Tradeoff A similar tradeoff (control vs. data-driven execution) canbe made at the microarchitecture levelISA: Specifies how the programmer sees instructions tobe executed- Programmer sees a sequential, control-flow execution order vs.- Programmer sees a data-flow execution order. Microarchitecture: How the underlying implementationactually executes instructions- Microarchitecture can execute instructions in any order as longas it obeys the semantics specified by the ISA when making theinstructionresultsvisibletosoftware· Programmer should see the order specified by the ISAComputerArchitecture10
Computer Architecture ISA vs. Microarchitecture Level Tradeoff • A similar tradeoff (control vs. data-driven execution) can be made at the microarchitecture level • ISA: Specifies how the programmer sees instructions to be executed – Programmer sees a sequential, control-flow execution order vs. – Programmer sees a data-flow execution order • Microarchitecture: How the underlying implementation actually executes instructions – Microarchitecture can execute instructions in any order as long as it obeys the semantics specified by the ISA when making the instruction results visible to software • Programmer should see the order specified by the ISA 10
按次数下载不扣除下载券;
注册用户24小时内重复下载只扣除一次;
顺序:VIP每日次数-->可用次数-->下载券;
- 《现代计算机体系结构》课程教学课件(留学生版)Lecture 0 Introduction and Performance Evaluation.pdf
- 《现代计算机体系结构》课程教学课件(留学生版)Lecture 3 Pipelining.pdf
- 《现代计算机体系结构》课程教学课件(留学生版)Lecture 2 Instruction Set Architecture(Microarchitecture Implementation).pdf
- 《现代计算机体系结构》课程教学课件(留学生版)Lecture 7 Multiprocessors.pdf
- 《现代计算机体系结构》课程教学课件(留学生版)Lecture 4 Spectualtive Execution.pdf
- 《现代计算机体系结构》课程教学课件(留学生版)Lecture 6 Memory Hierarchy and Cache.pdf
- 《现代计算机体系结构》课程教学课件(留学生版)Lecture 5 Out of Order Execution.pdf
- 武汉理工大学:《模式识别》课程教学资源(PPT课件)第4章 基于统计决策的概率分类法.ppt
- 武汉理工大学:《模式识别》课程教学资源(PPT课件)第1章 绪论、第2章 聚类分析.ppt
- 武汉理工大学:《模式识别》课程教学资源(PPT课件)第3章 判别函数及几何分类法.ppt
- 武汉理工大学:《模式识别》课程教学资源(PPT课件)第7章 模糊模式识别法.ppt
- 武汉理工大学:《模式识别》课程教学资源(PPT课件)第6章 句法模式识别.ppt
- 武汉理工大学:《模式识别》课程教学资源(PPT课件)第5章 特征选择与特征提取.ppt
- 武汉理工大学:《模式识别》课程教学资源(PPT课件)第8章 神经网络模式识别法.ppt
- 武汉理工大学:《模式识别》课程教学资源(实验指导,共五个实验).pdf
- 武汉理工大学:《模式识别》课程授课教案(讲义)第8章 神经网络在模式识别中的应用.pdf
- 武汉理工大学:《模式识别》课程授课教案(讲义)第7章 模糊模式识别.pdf
- 武汉理工大学:《模式识别》课程授课教案(讲义)第6章 特征提取与选择.pdf
- 武汉理工大学:《模式识别》课程授课教案(讲义)第5章 聚类分析.pdf
- 武汉理工大学:《模式识别》课程授课教案(讲义)第4章 非参数判别分类方法.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 12 Shared Memory Multiprocessor.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 15 GPGPU Architecture and Programming Paradigm.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 14 Towards Renewable Energy Powered Sustainable and Green Cloud Datacenters.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 11 Multi-core and Multi-threading.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 10 Out of Order and Speculative Execution.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 13 An Introduction to Cloud Data Centers.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 09 Case Study- Jave Branch Prediction Optimization.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 07 Instruction Decode.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 08 Instruction Fetch and Branch Predictioin.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 06 Scoreboarding and Tomasulo.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 04 Memory Data Prefetching.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 05 Core Pipelining.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 02 Memory Hierarchy and Caches.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 03 Main Memory and DRAM.pdf
- 《现代计算机体系结构》课程教学课件(英文讲稿)Lecture 01 Introduction and Performance Evaluation-new.pdf
- 东北大学:某学院计算机科学与技术专业《智能信息系统开发》课程教学大纲.pdf
- 东北大学:某学院计算机科学与技术专业《软件工程综合实践》课程教学大纲.pdf
- 东北大学:某学院计算机科学与技术专业《创新创业设计基础》课程教学大纲.pdf
- 东北大学:某学院计算机科学与技术专业《工程领导力》课程教学大纲.pdf
- 东北大学:某学院计算机科学与技术专业《高等数学建模》课程教学大纲(二).pdf