Memory and Repetitive Arithmetic Machines Prof. Sirer CS 316 Cornell University.

Slides:

Advertisements

Similar presentations

+ CS 325: CS Hardware and Software Organization and Architecture Internal Memory.

Advertisements

What is memory? Memory is used to store information within a computer, either programs or data. Programs and data cannot be used directly from a disk or.

Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University Memory See: P&H Appendix C.8, C.9.

Hakim Weatherspoon CS 3410, Spring 2011 Computer Science Cornell University Memory See: P&H Appendix C.8, C.9.

Chapter 9 Memory Basics Henry Hexmoor1. 2 Memory Definitions  Memory ─ A collection of storage cells together with the necessary circuits to transfer.

Overview Memory definitions Random Access Memory (RAM)

Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Sequential Logic Flip Flops Registers Memory Timing State Machines.

Chapter 0 Introduction to Computing

Overview Logic Combinational Logic Sequential Logic Storage Devices SR Flip-Flops D Flip Flops JK Flip Flops Registers Addressing Computer Memory.

Overview Recall Combinational Logic Sequential Logic Storage Devices

Registers  Flip-flops are available in a variety of configurations. A simple one with two independent D flip-flops with clear and preset signals is illustrated.

Lecture 4: Computer Memory

1 EECS Components and Design Techniques for Digital Systems Lec 21 – RTL Design Optimization 11/16/2004 David Culler Electrical Engineering and Computer.

Chapter 5 Internal Memory

COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Hao Ji.

1 Lecture 16B Memories. 2 Memories in General RAM - the predominant memory ROM (or equivalent) needed to boot ROM is in same class as Programmable Logic.

1 EE365 Read-only memories Static read/write memories Dynamic read/write memories.

Introduction to Registers Being just logic, ALUs require all the inputs to be present at once. They have no memory. ALU AB FS.

Chapter 6 Memory and Programmable Logic Devices

CS1104-8Memory1 CS1104: Computer Organisation Lecture 8: Memory

Counters and Registers

What’s on the Motherboard? The two main parts of the CPU are the control unit and the arithmetic logic unit. The control unit retrieves instructions from.

EKT 221 Digital Electronics II

Higher Computing Computer Systems S. McCrossan 1 Higher Grade Computing Studies 2. Computer Structure Computer Structure The traditional diagram of a computer...

Prof. Hakim Weatherspoon CS 3410, Spring 2015 Computer Science Cornell University See P&H Appendix B.8 (register files) and B.9.

Introduction to Computing: Lecture 4

1 Random-Access Memory (RAM) Note: We’re skipping Sec 7.5 Today: First Hour: Static RAM –Section 7.6 of Katz’s Textbook –In-class Activity #1 Second Hour:

EKT 221 : Digital 2 Memory Basics

Logic and Computer Design Dr. Sanjay P. Ahuja, Ph.D. FIS Distinguished Professor of CIS ( ) School of Computing, UNF.

Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms.

Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University Memory See: P&H Appendix C.8, C.9.

Memory Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University.

Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University Memory See: P&H Appendix C.8, C.9.

Memory and Storage Dr. Rebhi S. Baraka

Eng.Samra Essalaimeh Philadelphia University 2013/ nd Semester PIC Microcontrollers.

Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use ECE/CS 352: Digital Systems.

Memory System Unit-IV 4/24/2017 Unit-4 : Memory System.

Memory Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University.

Digital Logic Design Instructor: Kasım Sinan YILDIRIM

SEQUENTIAL CIRCUITS Component Design and Use. Register with Parallel Load  Register: Group of Flip-Flops  Ex: D Flip-Flops  Holds a Word of Data 

Chapter 3 Digital Logic Structures. 3-2 Combinational vs. Sequential Combinational Circuit always gives the same output for a given set of inputs  ex:

IT253: Computer Organization Lecture 9: Making a Processor: Single-Cycle Processor Design Tonga Institute of Higher Education.

CPS3340 COMPUTER ARCHITECTURE Fall Semester, /3/2013 Lecture 9: Memory Unit Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL.

Registers and Binary Arithmetic Prof. Sirer CS 316 Cornell University.

Random Access Memory (RAM).  A memory unit stores binary information in groups of bits called words.  The data consists of n lines (for n-bit words).

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 8 – Memory Basics Logic and Computer Design.

1 KU College of Engineering Elec 204: Digital Systems Design Lecture 22 Memory Definitions Memory ─ A collection of storage cells together with the necessary.

Memory 2. Activity 1 Research / Revise what cache memory is. 5 minutes.

Prof. Kavita Bala and Prof. Hakim Weatherspoon CS 3410, Spring 2014 Computer Science Cornell University See P&H Appendix B.8 (register files) and B.9.

Memory 2 ©Paul Godin Created March 2008 Memory 2.1.

1 To write any register, we need register address and a write signal A 3-bit write address is decoded if write signal is present One of the eight registers.

Latches, Flip Flops, and Memory ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin – Madison.

REGISTER TRANSFER & MICROOPERATIONS By Sohaib. Digital System Overview  Each module is built from digital components  Registers  Decoders  Arithmetic.

Computer Architecture Chapter (5): Internal Memory

RAM RAM - random access memory RAM (pronounced ramm) random access memory, a type of computer memory that can be accessed randomly;

Recap – Our First Computer WR System Bus 8 ALU Carry output A B S C OUT F 8 8 To registers’ read/write and clock inputs Sequence of control signal combinations.

Copyright © 2001 Stephen A. Edwards All rights reserved Busses  Wires sometimes used as shared communication medium  Think “party-line telephone”  Bus.

COMP211 Computer Logic Design

Recap DRAM Read Cycle DRAM Write Cycle FAST Page Access Mode

More Devices: Control (Making Choices)

Prof. Sirer CS 316 Cornell University

Chapter 11 Sequential Circuits.

Hakim Weatherspoon CS 3410 Computer Science Cornell University

Computer Science 210 Computer Organization

Prof. Kavita Bala and Prof. Hakim Weatherspoon

Digital Logic & Design Dr. Waseem Ikram Lecture 40.

The Processor Lecture 3.1: Introduction & Logic Design Conventions

Prof. Sirer CS 316 Cornell University

Memory and Repetitive Arithmetic Machines

Prof. Hakim Weatherspoon

Presentation transcript:

Memory and Repetitive Arithmetic Machines Prof. Sirer CS 316 Cornell University

Memory Various technologies S-RAM, D-RAM, NV-RAM Static-RAM So called because once stored, data values are stable as long as electricity is supplied Based on regular flip-flops with gates Dynamic-RAM Data values require constant refresh Internal circuitry keeps capacitor charges Non-Volatile RAM Data remains valid even through power outages More expensive Limited lifetime; after to 1M writes, NV-RAM degrades

S-RAM A decoder selects which line of memory to access A R/W selector determines the type of access That line is then coupled to the data lines How do you build large memories? Data Address Decoder

Tristate Buffers A device that couples a logic line to a wire

Big Memories Memory banks in parallel, with tri-state buffer and decoder to select which bank to couple The enable bit controls connection of data bits and clocking of internal flip-flops 12 2 enable addr data

Summary We now have enough building blocks to build machines that can perform non-trivial computational tasks

A Calculator User enters the numbers to be added or subtracted using toggle switches User selects ADD or SUBTRACT Muxes feed A and B, or A and –B, to the 8-bit adder The 8-bit decoder for the hex display is straightforward (but not shown in detail) 0101 adder mux reg led-dec add/sub select … … doit

A Vote Counter Data values flow from set of parallel registers (a register file) to the addition unit back into the register file 0 mux reg led-dec deco clk enc s1 s4 s1 s2 s3 reg