1 / 12

An Example Architecture

An Example Architecture. A Paper Computer - Woody. Woody's characteristics Word size – 8 bits. One word. A Paper Computer - Woody. Main Memory. Woody's characteristics Word size – 8 bits Memory size – 32 words. A Paper Computer - Woody. Main Memory. Woody's characteristics

lininger
Télécharger la présentation

An Example Architecture

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An Example Architecture

  2. A Paper Computer - Woody • Woody's characteristics • Word size – 8 bits One word

  3. A Paper Computer - Woody Main Memory • Woody's characteristics • Word size – 8 bits • Memory size – 32 words ...

  4. A Paper Computer - Woody Main Memory • Woody's characteristics • Word size – 8 bits • Memory size – 32 words • Memory addresses are 0 through 31 How many bits does it take to represent an address? ...

  5. A Paper Computer - Woody Main Memory • Woody's characteristics • Word size – 8 bits • Memory size – 32 words • Memory addresses are 0 through 31. 3110 = 111112 ...

  6. A Paper Computer - Woody Main Memory • Woody's characteristics • Word size – 8 bits • Memory size – 32 words • Memory addresses are 0 through 31. 3110 = 111112 • Addresses can be represented with 5 bits 00000 00001 00010 00011 00100 00101 00110 00111 01000 01001 ... 11110 11111

  7. A Paper Computer - Woody Main Memory • Woody's characteristics • Word size – 8 bits • Memory size – 32 words • Memory addresses are 0 through 31. 3110 = 111112 • Addresses can be represented with 5 bits • Woody uses signed magnitude representation for storing integers (no floating point) 00000 00001 00010 00011 00100 00101 00110 00111 01000 01001 ... 11110 11111

  8. Woody's CPU Central Processing Unit • Instruction register – holds currently executing instruction from program • Program Counter Register – hold address of next instruction to execute • Data Register – holds the data used in the execution of an instruction Instruction Register Program Counter Register Data Register

  9. Other Components • Input unit – device that allows the user to enter values – e.g. keyboard • Output unit – device that allows Woody to display a value (e.g. screen)

  10. Woody's Assembly Language

  11. Machine Language • Instructions must be in binary form to execute • Woody can't store "CopyFrom" nor understand what to do with it • It is easiest if all instructions are the same size and fit into a single word • How big can our instructions be?

  12. Woody's Machine Language

More Related