[Principles of Computer Composition] Final Key Points


Preface

Chapter analysis can be skipped

Insert image description here


Chapter analysis

Chapter 1 [Introduction to Computer Systems]

  • Computer performance indicators
  • 【Hierarchical structure diagram of computer system】

Chapter 2 [Operation methods and operators]

  • 【IEEE754】
  • Data format: fixed point number, floating point number
  • Machine code representation of numbers: original code, complement code, complement code, frame code
    Insert image description here
  • binary conversion
    • IEEE754 standard storage format conversion
    • Binary to decimal: weighting coefficient expansion
    • Convert decimal to binary: Integer part: divide by 2, take remainder, arrange in reverse order; decimal part: multiply by 2, round to integer, arrange in order
  • Addition and subtraction of floating point numbers
  • [Example 2.5] [Example 2.6] [Example 2.7]

Chapter 3 [Storage System]

  • Technical indicators of memory: storage capacity, access time, access cycle, memory bandwidth (data transfer rate, bandwidth)

  • [SRAM read/write cycle timing diagram]

  • Expansion of storage capacity: bit expansion, word expansion, word bit expansion

  • [Multi-module interleaved memory (computing)]

  • [cache hit rate (calculation)]

  • [Main memory and cache address mapping (calculation): fully associative, direct mapping, set associative]

  • [DRAM chip related calculations (calculations) (word bit expansion)]

  • [Figure 3.6 SRAM read/write cycle timing diagram] [Example 3.3] [Example 3.4] [Example 3.6] [Exercise 4]


Chapter 4 [Command System]

  • 【Instruction Analysis】
  • [The difference between the four addressing methods]
  • [Example 4.3]

Chapter 5 [Central Processing Unit]

  • [Use block diagram language to represent the instruction cycle]
  • [Relationship between machine instructions and microinstructions]
  • Encoded representation, mixed representation
  • horizontal microinstructions
  • [Example 5.1] [Figure 5.27 The relationship between machine instructions and microinstructions]

Chapter Six [Bus System]


Chapter 7 [Peripheral Equipment]

  • 【Disk Computing】
  • [Example 7.1]

Chapter 8 [Input/Output System]

  • [How the CPU manages peripheral devices] ppt
  • [In computer systems, the way the CPU manages peripheral devices p244]

Question type analysis

  • Computer system hierarchy diagram
  • Data format conversion; IEEE754 ; floating point addition and subtraction operations + overflow judgment (dual symbol method)
  • SRAM read/write timing diagram
  • Related calculations of multi-module interleaved memory
  • Cache hit rate related calculations
  • Main memory and Cache address mapping (full, direct, set associative )
  • Calculations related to memory sticks and DRAM chips
  • Storage capacity expansion
  • Instruction analysis
  • Instruction format extension (zero address)
  • Data path, instruction cycle flow chart (instruction cycle expressed in block diagram language)
  • Microcommand encoding (encoded representation, mixed representation)
  • horizontal microinstructions
  • disk computing
  • Several ways for CPU to manage peripheral devices

short answer questions

  • 【Hierarchical structure of computer system】
    • High-level language level----supported and executed by various high-level language compilers
    • Assembly language level - supported and executed by the assembler
    • Operating system level - implemented by the operating system program
    • General machine level - the machine instruction system is interpreted by microprograms
    • Microprogramming level - directly executed by hardware
  • [The difference between the four addressing methods]
    • Direct addressing:
      • Directly indicate the memory address of the operand in the address field of the instruction format.
      • The memory access time is increased, the instruction length is limited, and the number of address codes generally does not exceed 2
    • Indirect addressing:
      • The formal address in the address field of the instruction is not the true address of the operand, but an indicator of the address of the operand.
      • The same instruction can access data placed in different main memory units. Compared with direct addressing, the addressing range is expanded, but the memory access time is increased and the execution speed is reduced.
    • Register addressing:
      • The operand is not in the memory, but is placed in the general register of the CPU. The instruction directly specifies the register to be used.
      • Data is stored directly in registers without additional memory access. It is fast and can improve program execution efficiency. It is suitable for scenarios where data is frequently accessed and manipulated.
    • Register indirect addressing:
      • The register content in the instruction format is not the operand, but the operand address. The operand specified by the address is in the memory.
      • It has strong flexibility, allowing the program to dynamically change the target address of addressing during execution, helping to implement complex access operations such as data structures, arrays, and function calls, and reducing the length of instructions.
  • [Relationship between machine instructions and microinstructions]
    • One machine instruction corresponds to a microprogram, which consists of several microinstructions. The function of a machine instruction is realized by a sequence composed of several microinstructions. The operation completed by a machine instruction is divided into several microinstructions to complete, and the microinstructions interpret and complete it. (Program->Instruction->Microprogram->Microinstruction->Microcommand)
    • Judging from the one-to-one correspondence between instructions and microinstructions, programs and microprograms, and addresses and microaddresses, the former is related to the memory memory, and the latter is related to the control memory.
    • One machine instruction corresponds to 4 CPU cycles, and each CPU cycle corresponds to a microinstruction.
      Insert image description here
  • [How the CPU manages peripheral devices]
    • Unconditional transfer method (simple I/O method)
    • Program query (polling) method
    • Program interrupt mode
    • Direct memory access (DMA) method
    • Channel and input/output processors
  • What factors need to be considered when choosing how to represent numerical data on a computer?
    • The hardware cost of data storage and processing
    • range of values ​​that may be encountered
    • Numerical accuracy
    • The type of number to represent (decimal, integer, real, negative)

Analysis questions

  • [SRAM read/write timing diagram]
  • [Data path, instruction cycle flow chart (instruction cycle expressed in block diagram language)]
  • [Character expansion]
  • horizontal microinstructions

Application questions

  • [Main memory and Cache address mapping (group association)]
  • [Calculations related to memory sticks and DRAM chips]
  • 【Instruction Analysis】
  • Microcommand encoding (encoded representation, mixed representation)

Calculation problems

  • [IEEE754] Data format conversion; floating point addition and subtraction operations; overflow judgment (double symbol method)
  • [Related calculations of multi-module cross-memory]
  • [Calculation related to Cache hit rate]
  • 【Disk Computing】

Guess you like

Origin blog.csdn.net/Lenhart001/article/details/131322856