Lecture 0: Organization

Similar documents
We are here. Assembly Language. Processors Arithmetic Logic Units. Finite State Machines. Circuits Gates. Transistors

Lecture 2: Digi Logic & Bus

Advanced Devices. Registers Counters Multiplexers Decoders Adders. CSC258 Lecture Slides Steve Engels, 2006 Slide 1 of 20

Outline. 1 Reiteration. 2 Dynamic scheduling - Tomasulo. 3 Superscalar, VLIW. 4 Speculation. 5 ILP limitations. 6 What we have done so far.

Slide Set 9. for ENCM 501 in Winter Steve Norman, PhD, PEng

6.3 Sequential Circuits (plus a few Combinational)

CS152 Computer Architecture and Engineering Lecture 17 Advanced Pipelining: Tomasulo Algorithm

Logic Devices for Interfacing, The 8085 MPU Lecture 4

BUSES IN COMPUTER ARCHITECTURE

Computer Organization & Architecture Lecture #5

Low Power VLSI Circuits and Systems Prof. Ajit Pal Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Tomasulo Algorithm Based Out of Order Execution Processor

Sequential Logic. Introduction to Computer Yung-Yu Chuang

Spring 2017 EE 3613: Computer Organization Chapter 5: The Processor: Datapath & Control - 1

A First Laboratory Course on Digital Signal Processing

CS 61C: Great Ideas in Computer Architecture

CS3350B Computer Architecture Winter 2015

Timing EECS141 EE141. EE141-Fall 2011 Digital Integrated Circuits. Pipelining. Administrative Stuff. Last Lecture. Latch-Based Clocking.

Logic Design II (17.342) Spring Lecture Outline

Logic Design ( Part 3) Sequential Logic- Finite State Machines (Chapter 3)

Slide Set 8. for ENCM 501 in Winter Term, Steve Norman, PhD, PEng

Instruction Level Parallelism and Its. (Part II) ECE 154B

Administrative issues. Sequential logic

North Shore Community College

COMP12111: Fundamentals of Computer Engineering

Contents Slide Set 6. Introduction to Chapter 7 of the textbook. Outline of Slide Set 6. An outline of the first part of Chapter 7

Objectives. Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath

Computer Graphics NV1 (1DT383) Computer Graphics (1TT180) Cary Laxer, Ph.D. Visiting Lecturer

CHAPTER 4 RESULTS & DISCUSSION

CS 110 Computer Architecture. Finite State Machines, Functional Units. Instructor: Sören Schwertfeger.

CH 11 Latches and Flip-Flops

T 2 : WR = 0, AD 7 -AD 0 (μp Internal Reg.) T 3 : WR = 1,, M(AB) AD 7 -AD 0 or BDB

COMP2611: Computer Organization. Introduction to Digital Logic

BCN1043. By Dr. Mritha Ramalingam. Faculty of Computer Systems & Software Engineering

Microprocessor Design

Digital Logic Design ENEE x. Lecture 24

UNIT V 8051 Microcontroller based Systems Design

Testability: Lecture 23 Design for Testability (DFT) Slide 1 of 43

Lecture 23 Design for Testability (DFT): Full-Scan

EECS150 - Digital Design Lecture 9 - CPU Microarchitecture. CMOS Devices

CSE140L: Components and Design Techniques for Digital Systems Lab. CPU design and PLDs. Tajana Simunic Rosing. Source: Vahid, Katz

WELCOME. ECE 2030: Introduction to Computer Engineering* Richard M. Dansereau Copyright by R.M. Dansereau,

Computer Architecture Spring 2016

AM AM AM AM PM PM PM

EE 367 Lab Part 1: Sequential Logic

Why FPGAs? FPGA Overview. Why FPGAs?

Computer Systems Architecture

Previous Lecture Sequential Circuits. Slide Summary of contents covered in this lecture. (Refer Slide Time: 01:55)

FPGA Design. Part I - Hardware Components. Thomas Lenzi

Enhancing Performance in Multiple Execution Unit Architecture using Tomasulo Algorithm

VLSI Design: 3) Explain the various MOSFET Capacitances & their significance. 4) Draw a CMOS Inverter. Explain its transfer characteristics

CprE 281: Digital Logic

Tomasulo Algorithm. Developed at IBM and first implemented in IBM s 360/91

Final Exam CPSC/ECEN 680 May 2, Name: UIN:

Advanced Pipelining and Instruction-Level Paralelism (2)

Lecture 23 Design for Testability (DFT): Full-Scan (chapter14)

COE328 Course Outline. Fall 2007

Sequential Elements con t Synchronous Digital Systems

CPE300: Digital System Architecture and Design

for Digital IC's Design-for-Test and Embedded Core Systems Alfred L. Crouch Prentice Hall PTR Upper Saddle River, NJ

University of Pennsylvania Department of Electrical and Systems Engineering. Digital Design Laboratory. Lab8 Calculator

Instruction Level Parallelism Part III

Review C program: foo.c Compiler Assembly program: foo.s Assembler Object(mach lang module): foo.o. Lecture #14

CS61C : Machine Structures

Design for Testability

Chapter 2. Digital Circuits

Handout 16. by Dr Sheikh Sharif Iqbal. Memory Interface Circuits 80x86 processors

EECS150 - Digital Design Lecture 10 - Interfacing. Recap and Topics

Instruction Level Parallelism Part III

First Name Last Name November 10, 2009 CS-343 Exam 2

CSE115: Digital Design Lecture 23: Latches & Flip-Flops

LAB #4 SEQUENTIAL LOGIC CIRCUIT

CHAPTER1: Digital Logic Circuits

Modeling Digital Systems with Verilog

Slide Set 6. for ENCM 369 Winter 2018 Section 01. Steve Norman, PhD, PEng

Out-of-Order Execution

Flip-Flops and Registers

Outline. EECS150 - Digital Design Lecture 27 - Asynchronous Sequential Circuits. Cross-coupled NOR gates. Asynchronous State Transition Diagram

Digital Design Datapath Components: Parallel Load Register

DYNAMIC INSTRUCTION SCHEDULING WITH TOMASULO

The word digital implies information in computers is represented by variables that take a limited number of discrete values.

Dr.Mohamed Elmahdy Winter 2015 Eng.Yasmin Mohamed. Problem Set 6. Analysis and Design of Clocked Sequential Circuits. Discussion: 7/11/ /11/2015

Slide Set 7. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary

Find the equivalent decimal value for the given value Other number system to decimal ( Sample)

Implementation of an MPEG Codec on the Tilera TM 64 Processor

Sequencing and Control

CHAPTER 11 LATCHES AND FLIP-FLOPS

A video signal processor for motioncompensated field-rate upconversion in consumer television

A Combined Combinational-Sequential System

Tutorial Introduction

INC 253 Digital and electronics laboratory I

Electrical and Telecommunications Engineering Technology_TCET3122/TC520. NEW YORK CITY COLLEGE OF TECHNOLOGY The City University of New York

Chapter 3 Instruction-Level Parallelism and its Exploitation (Part 1)

# "$ $ # %!"$!# &!'$("!)!"! $ # *!"! $ '!!$ #!!)! $ "# ' "

CS61C : Machine Structures

Registers. Unit 12 Registers and Counters. Registers (D Flip-Flop based) Register Transfers (example not out of text) Accumulator Registers

Digital Circuits ECS 371

Where Are We Now? e.g., ADD $S0 $S1 $S2?? Computed by digital circuit. CSCI 402: Computer Architectures. Some basics of Logic Design (Appendix B)

Senior Design Project: Blind Transmitter

Lecture 16: Instruction Level Parallelism -- Dynamic Scheduling (OOO) via Tomasulo s Approach

Transcription:

581365 Tietokoneen rakenne Computer Organization II Spring 2010 Tiina Niklander Matemaattis-luonnontieteellinen tiedekunta Computer Organization II Advanced (master) level course! Prerequisite: Computer Organization I (TiTo) Main hardware Symbolic assembly language, machine instructions Instruction cycle (on CPU) Related to Operating Systems Interrupts Virtual memory I/O Techniques Computer Organization II, Spring 2010, Tiina Niklander 19.1.2010 2 Comp. Org II, Spring 2010 1

Material Course book (Make sure you have one!) Stallings W.: Computer Organization & Architecture, Designing for Performance (8th ed), Prentice-Hall, 2009. (7&6th ed.) possible, but MISSING a lot of material Course page (for this Spring course) http://www.cs.helsinki.fi/u/niklande/opetus/tikra/2010/index. en.html Slides, exercises, announcements, links, etc. Course main page http://www.cs.helsinki.fi/kurssit/syventavat/581365/ Old courses, slides in Finnish and English, etc. Newsgroup: hy.tktl.opiskelu.tikra Computer Organization II, Spring 2010, Tiina Niklander 19.1.2010 3 Schedule Spring 2010 Lectures: 18.1. 26.2.2009 In Finnish: Tue and Thu 14-16, D122 English summary: Fri 12-14 CK111 (Mon 18.1. 14-16 C220) Exercises: In English: Päivi Kuuppelomäki Wed 14-16 CK111 In Finnish: Tiina Niklander Wed 16-18 C222 Course Exam Wed 3.3. 16.00-19 A111 Separate exams are also available Computer Organization II, Spring 2010, Tiina Niklander 19.1.2010 4 Comp. Org II, Spring 2010 2

Comp Org I (TITO): lowest presentation level A := B + C; High-level lang. MOV AX, B ADD AX, C MOV A, AX Assembler Sta06: Fig 12.6 Functionality! What happens in the system? Computer Organization II, Spring 2010, Tiina Niklander 19.1.2010 5 Comp Org II (TIKRA): lowest presentation level MOV AX, B ADD AX, C MOV A, AX Assembler Logical circuits Sta06: Fig 17.7 Implementation! How is the hardware composed? Computer Organization II, Spring 2010, Tiina Niklander 19.1.2010 6 Comp. Org II, Spring 2010 3

Learning goals Digital logic: truth table, flip-flop,... Bus: multiplexing, signaling Memory hierarchy: cache, TLB Arithmetics: Booth algorithm, representations Instruction set: operands, operations, memory reference Processor structure and functions: pipelining, RISC,CISC Control: micro-operations, micro-programmed control, clock pulse Parallel Processing: cache coherence, multicore More detailed learning goals (at the moment only in Finnish) are available from course main page Computer Organization II, Spring 2010, Tiina Niklander 19.1.2010 7 Course content and schedule Week 1 Overview (Ch 1 8) Bus (Ch 3) Self-study: Digital logic Week 2 Memory, cache (Ch 4, 5) Virtual memory(ch 8.3-8.6) Week 3 Computer arithmetics (Ch 9) Instruction set (Ch 10, 11) Week 4 CPU struc.& func. (Ch 12) RISC-architecture (Ch 13) Week 5 Instruction-level parallelism, superscalar processor (Ch 14) Control Unit (Ch 15-16) Week 6 Parallel Processing & Multicore (Ch 17-18) Recapitulation Computer Organization II, Spring 2010, Tiina Niklander 19.1.2010 8 Comp. Org II, Spring 2010 4

Motto It is not good exercise, If you do not sweat Kunto ei nouse ellei tule hiki. Computer Organization II, Spring 2010, Tiina Niklander 19.1.2010 9 Work during the course Combine the details together to form a larger picture (in your mind)! Try to continuously understand and analyse the connections Stay awake! Make notes Write down own ideas and questions immediately Ask questions Question are never too simple. (If you missed the point, then somebody else missed it also) Ask from teachers but also from co-students. Teamwork is allowed even with individual assignments However, own paper must be written by you, even if you cooperated in learning the content Computer Organization II, Spring 2010, Tiina Niklander 19.1.2010 10 Comp. Org II, Spring 2010 5

Be active! Do all exercises in advance! On your own / in small teams. Think about the problem during several days - at least before giving up Learning by doing! Ask about the problematic parts During lectures While solving the questions When solutions are presented Afterwards from instructors Beginning of next meeting Computer Organization II, Spring 2010, Tiina Niklander 19.1.2010 11 Note! These slides are just the table of content - ~ notes of the lecturer Read the book! ~ just following the lectures or summary is not enough Spend enough time in learning the content Simple time estimation (for planning) VERY OLD: ~ 6,5 weeks*(2*(4+2)) = 78 hours OLD: 4 op = 2 ov: 2 * 40 = 80 hours CURRENT: 1 year / 60 op = 1600 t / 60 op = 26.67 t / 1 op = 107 hours / 4 op Enjoy the course! Computer Organization II, Spring 2010, Tiina Niklander 19.1.2010 12 Comp. Org II, Spring 2010 6

Credits Teemu Kerola 1999-2003 Original slides (in English), blue layout - Based on 5 th edition Updated to 6 th edition 2002 Auvo Häkkinen 2004-2005 Most slides translated to Finnish, orange layout - Figures integrated to slides Updated to 7 th edition 2005 Teemu Kerola 2006 Liisa Marttinen 2007 Tiina Niklander 2009: Translation to English from the Finnish slide set 2010: Updated to 8 th edition Computer Organization II, Spring 2010, Tiina Niklander 19.1.2010 13 Comp. Org II, Spring 2010 7