1 / 10

CS 311: Computer Organization

CS 311: Computer Organization. Aim of this course:

reed
Download Presentation

CS 311: Computer Organization

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. CS 311: Computer Organization • Aim of this course: • This course (CS 311) deals with computer architecture as well as computer organization. Computer architecture is concerned with the structure and behavior of the various functional modules of the computer and how they interact to provide the processing needs of the user. Computer organization is concerned with the way the hardware components are connected together to form a computer system. • Main Text • M. Morris Mano, “Computer System Architecture,” Prentice-Hall Inc., 3rd ed. • Supplementary Text • D. Patterson & J. Hennessy, “Computer Organization & Design: • The Hardware/Software Interface” • Class Note based on the main text (Available at the instructor’s home page)

  2. CS 311: Computer Organization • TA: 김동욱 (박사과정) (x5578, kimdw@camars.kaist.ac.kr), • 강미경 (석사 2) (x3552, mkkang@camars.kaist.ac.kr) • (Tentative) Grading Policy: • Midterm(37%), Final(48%), HW(10%), Reserved(5%) • Days/Time/Room: • Mon, Wed / 14:30-15:45 / Room #2112 • Midterm: 4:00 ~ 7:00 pm, April 26, 2006 • Final Exam: 4:00 ~7:00 pm, June 21, 2006 • (Exam schedule can be changed later..)

  3. Computer Architecture Lab 소개 • Prof. 조정완, • Prof. 맹승렬, • Prof. 윤현수, • Prof. 이흥규, • Prof. 이준원, • Prof. 김진수

  4. Courses Offered by CA Lab. Prof.’s CS 211: Digital Systems & Labs 더 이상 필수과목이 아님 CS 310: Micorprocessors & Labs (O) CS 311: Computer Organization (OO) CS 330: Operating Systems & Labs CS 412: Computer Architecture Labs CS 440: Data Communication (OO) CS 510: Computer Architecture (O) CS 530: Operating System SEP543: Computing Security (OO) CS 610: Parallel Processing CS 614: Advanced Computer Architecture (O) CS 616: Realtime Systems CS 710: Topics in Computer Architecture (OO) CS 712: Topics in Parallel Processing (OO) CS 714: Topics in Fault-Tolerant Architecture CS 730: Topics in Operating Systems

  5. Course Syllabus Chap. 1: Digital Logic Circuits (skip but need to be studied) • Logic Gates, • Boolean Algebra • Map Simplification, • Combinational Circuits • Filp-Flops, • Sequential Circuits Chap. 2: Digital Components (skip but need to be studied) • Integrated Circuits, • Decoders, • Multiplexers • Registers, • Shift Registers, • Binary Counters • Memory Unit Chap. 3: Data Representation • Data Types, • Complements • Fixed Point Representation • Floating Point Representation • Other Binary Codes, • Error Detection Codes

  6. Chap. 4: Register Transfer and Microoperations • Register Transfer Language, • Register Transfer • Bus and Memory Transfers • Arithmetic Microoperations • Logic Microoperations, • Shift Microoperations • Arithmetic Logic Shift Unit Chap. 5: Basic Computer Organization and Design • Instruction Codes, • Computer Registers • Computer Instructions, • Timing and Control • Instruction Cycle, • Memory Reference Instructions • Input-Output and Interrupt • Complete Computer Description • Design of Basic Computer • Design of Accumulator Logic

  7. Chap. 6: Programming the Basic Computer • Machine Language, • Assembly Language • Assembler, • Program Loops • Programming Arithmetic and Logic Operations • Subroutines, • Input-Output Programming Chap. 7: Microprogrammed Control • Control Memory, • Sequencing Microinstructions • Microprogram Example, • Design of Control Unit • Microinstruction Format Chap. 8: Central Processing Unit • General Register Organization • Stack Organization, • Instruction Formats • Addressing Modes • Data Transfer and Manipulation • Program Control • Reduced Instruction Set Computer Midterm Exam

  8. Chap. 9: Pipeline and Vector Processing • Parallel Processing, • Pipelining • Arithmetic Pipeline, • Instruction Pipeline • RISC Pipeline, • Vector Processing Chap. 10: Computer Arithmetic (skip) • Arithmetic with Signed-2's Complement Numbers • Multiplication and Division Algorithms • Floating-Point Arithmetic Operations • Decimal Arithmetic Unit • Decimal Arithmetic Operations Chap. 11: Input-Output Organization • Peripheral Devices, • Input-Output Interface • Asynchronous Data Transfer, • Modes of Transfer • Priority Interrupt, • Direct Memory Access

  9. Chap. 12: Memory Organization • Memory Hierarchy, • Main Memory • Auxiliary Memory. • Associative Memory • Cache Memory, • Virtual Memory Chap. 13: Multiprocessors () • Characteristics of Multiprocessors • Interconnection Structures • Interprocessor Arbitration • Interprocessor Communication/Synchronization • Cache Coherence Final Exam

  10. HW#1 (Ch1) P.1-3, 1-7, 1-9, 1-15, 1-17, 1-20 Due by 3/13/2006 HW#2 (Ch2) P.2-3, 2-7, 2-14, 2-19, 2-23 Due by 3/20/2006 Homeworks

More Related