1 / 9

computer science

CSCI 1001. overview of. computer science. COMPUTER ORGANIZATION II. what’s under the hood?. 1. Fetch. P rogram C ounter. I nstruction R egister. 2. Decode. 3. Execute. Instruction Decoder. branch. opcode. arguments. transfer. ALU op. ALU. how fast?. Bus: words/second (FSB MHz).

abedi
Télécharger la présentation

computer science

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. CSCI 1001 overview of computer science COMPUTER ORGANIZATION II

  2. what’s under the hood?

  3. 1. Fetch Program Counter Instruction Register 2. Decode 3. Execute Instruction Decoder branch opcode arguments transfer ALU op ALU

  4. how fast? Bus: words/second (FSB MHz) Disk: revolutions/minute (RPM) Clock: cycles/second (GHz) MIPS: Millions of Instructions/second FLOPS: floating point ops/second

  5. LOOP: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 IN 13 LOAD 11 COMPARE 13 JUMPEQ 9 LOAD 12 COMPARE 13 JUMPLT 0 INCREMENT 14 JUMP 0 OUT 14 HALT -1 21 0 0 AGE V_END AGE END V_21 AGE LOOP COUNT LOOP COUNT 1101 1101 0000 1011 0111 1101 1010 1001 0000 1100 0111 1101 1011 0000 0100 1110 1000 0000 1110 1110 1111 1111 1111 1111 0001 0101 0000 0000 0000 0000 END: V_END: V_21: AGE: COUNT:

  6. 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 IN X IN Y LOOP: LOAD V_0 COMPARE Y JUMPEQ END LOAD X ADD Z STORE Z DECREMENT Y JUMP LOOP END: OUT Z HALT X: 0 Y: 0 V_0: 0 Z: 0 12 13 14 13 10 12 15 15 13 2 15 1101 1100 1101 1101 0000 1110 0111 1101 1010 1010 0000 1100 0011 1111 0001 1111 0100 1101 1000 0010 1110 1111 1111 1111 0000 0000 0000 0000 0000 0000 0000 0000

  7. http://cs1001.us/ Please read sections 6.2-6.3 of the textbook for Friday’s lecture.

More Related