Computer Architecture & Operations I

Slides:



Advertisements
Similar presentations
Figure (a) 8 * 8 array (b) 16 * 8 array.
Advertisements

Computer Organization and Architecture
Computer Organization and Architecture
Prith Banerjee ECE C03 Advanced Digital Design Spring 1998
+ CS 325: CS Hardware and Software Organization and Architecture Internal Memory.
5-1 Memory System. Logical Memory Map. Each location size is one byte (Byte Addressable) Logical Memory Map. Each location size is one byte (Byte Addressable)
LOGO.  Concept:  Is read-only memory.  Do not lose data when power is lost.  ROM memory is used to produce chips with integrated.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /23/2013 Lecture 7: Computer Clock & Memory Elements Instructor: Ashraf Yaseen DEPARTMENT OF MATH &
COEN 180 DRAM. Dynamic Random Access Memory Dynamic: Periodically refresh information in a bit cell. Else it is lost. Small footprint: transistor + capacitor.
Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University Memory See: P&H Appendix C.8, C.9.
1 The Basic Memory Element - The Flip-Flop Up until know we have looked upon memory elements as black boxes. The basic memory element is called the flip-flop.
1 Lecture 16B Memories. 2 Memories in General Computers have mostly RAM ROM (or equivalent) needed to boot ROM is in same class as Programmable Logic.
Overview Memory definitions Random Access Memory (RAM)
CS 151 Digital Systems Design Lecture 30 Random Access Memory (RAM)
Computer Organization and Architecture
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.
Contemporary Logic Design Sequential Case Studies © R.H. Katz Transparency No Chapter #7: Sequential Logic Case Studies 7.6 Random Access Memories.
Physical Memory and Physical Addressing By: Preeti Mudda Prof: Dr. Sin-Min Lee CS147 Computer Organization and Architecture.
Memory Technology “Non-so-random” Access Technology:
Memory Basics Chapter 8.
Prof. Hakim Weatherspoon CS 3410, Spring 2015 Computer Science Cornell University See P&H Appendix B.8 (register files) and B.9.
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:
Main Memory -Victor Frandsen. Overview Types of Memory The CPU & Main Memory Types of RAM Properties of DRAM Types of DRAM & Enhanced DRAM Error Detection.
SYEN 3330 Digital SystemsJung H. Kim 1 SYEN 3330 Digital Systems Chapter 9 – Part 1.
Digital Electronics Chapter 7 Memory and Programmable Logic.
Memory System Unit-IV 4/24/2017 Unit-4 : Memory System.
Memory Intro Computer Organization 1 Computer Science Dept Va Tech March 2006 ©2006 McQuain & Ribbens Built using D flip-flops: 4-Bit Register Clock input.
Memory Devices May be classified as: Connections: ROM; Flash; SRAM;
CPEN Digital System Design
Memory Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University.
Digital Logic Design Instructor: Kasım Sinan YILDIRIM
+ CS 325: CS Hardware and Software Organization and Architecture Memory Organization.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /3/2013 Lecture 9: Memory Unit Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL.
Feb. 26, 2001Systems Architecture I1 Systems Architecture I (CS ) Lecture 12: State Elements, Registers, and Memory * Jeremy R. Johnson Mon. Feb.
COMP203/NWEN Memory Technologies 0 Plan for Memory Technologies Topic Static RAM (SRAM) Dynamic RAM (DRAM) Memory Hierarchy DRAM Accelerating Techniques.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Dr. Shi Dept. of Electrical and Computer Engineering.
Memory Devices 1. Memory concepts 2. RAMs 3. ROMs 4. Memory expansion & address decoding applications 5. Magnetic and Optical Storage.
Digital Circuits Introduction Memory information storage a collection of cells store binary information RAM – Random-Access Memory read operation.
07/11/2005 Register File Design and Memory Design Presentation E CSE : Introduction to Computer Architecture Slides by Gojko Babić.
5-1 ECE 424 Design of Microprocessor-Based Systems Haibo Wang ECE Department Southern Illinois University Carbondale, IL
Chapter 5 - Internal Memory 5.1 Semiconductor Main Memory 5.2 Error Correction 5.3 Advanced DRAM Organization.
Appendix B The Basics of Logic Design
Lecture 3. Lateches, Flip Flops, and Memory
CS 1251 Computer Organization N.Sundararajan
Computer Architecture & Operations I
Computer Architecture & Operations I
Memories.
William Stallings Computer Organization and Architecture 7th Edition
COMP211 Computer Logic Design
Computer Architecture & Operations I
Types of RAM (Random Access Memory)
Morgan Kaufmann Publishers
Exam 2 Review Two’s Complement Arithmetic Ripple carry ALU logic and performance Look-ahead techniques, performance and equations Basic multiplication.
Memory Units Memories store data in units from one to eight bits. The most common unit is the byte, which by definition is 8 bits. Computer memories are.
William Stallings Computer Organization and Architecture 7th Edition
Types of Memory For Embedded System Development
Hakim Weatherspoon CS 3410 Computer Science Cornell University
EE345: Introduction to Microcontrollers Memory
Prof. Kavita Bala and Prof. Hakim Weatherspoon
Lecture 14 - Dynamic Memory
William Stallings Computer Organization and Architecture 7th Edition
Digital Logic & Design Dr. Waseem Ikram Lecture 40.
Chapter 4: MEMORY.
Sequential Logic.
Prof. Hakim Weatherspoon
4-Bit Register Built using D flip-flops:
Presentation transcript:

Computer Architecture & Operations I Instructor: Ryan Florin

Register Files Register Files Large Scale Memory Can be used to build small memory Too costly to build large amount of memory Large Scale Memory Static random access memories (SRAM) Dynamic random access memories (DRAM)

SRAMs SRAM Example: 8Mx8 SRAM Integrated circuits of memory arrays A single access port Either read or write Fixed access time to any datum Height Number of addressable locations Width Number of output bits per unit Example: 8Mx8 SRAM 8M = 223, 23 address lines 8 output bits

2Mx16 SRAM 21-bit address line 16-bit data input/output

Implementation of Large SRAM Register File Use Multiplexor 32x1 Multiplexor Large SRAM Impractical to use a large multiplexor like 64kx1 Try to remember the implementation of a two input multiplexor Solution A more efficient implementation of Multiplexor Shared output line (bit line) Allow multiple sources to drive a single output line

Three State Buffer Two inputs A single output A data signal An output enable (output select) A single output Three states Output enable = 1 Asserted (1) state Deasserted (0) state Output enable = 0 High Impedance state Allow the another three-state buffer with output enable =1 to determine the output

Multiplexor using Three-State Buffers Two inputs A data signal An output enable (output select) A single output Three states Output enable = 1 Asserted (1) state Deasserted (0) state Output enable = 0 High Impedance state Allow the another three-state buffer with output enable =1 to determine the output

Organization of a 4M SRAM Array of 8 Modules – Each for a bit Addr 21-10 Use a 12 to 4096 decoder Select an array of1024 bits out of 4K 1024 bits Addr 9-0 Select 1 bit from the 1024 bits as an output bit

DRAM SRAM DRAM Requires 4-6 transistors per bit Fast But costly Requires 1 transistor per bit Charge stored in a capacitor Needs to be refreshed periodically Slower than SRAM But less expensive

Organization of a 4M DRAM Addr 11-21 Select 1 row from 2048 rows Addr 10-0 Select 1 bit from the 2048 bits as an output bit Column Latches Store the selected output from 2048x2048 array temporally

DRAM

SRAM and DRAM SRAM DRAM Fast but costly Small amount Used for Computer Cache DRAM Slow but less costly Large amount Used for Computer Main Memory

Error Detection and Correction Error in large memory Potential of data corruption Error Checking Code Detect possible corruption data Error Correction Code Correct possible corruption data

Parity Code Mechanism of (Even) Parity Code Count the number of 1s in a word If the number of 1s is odd 1 If the number of 1s is even Example Data Parity bit 01100111 1 When a word is written into memory, the parity bit is also calculated and written When a word is read, if the parity bit does not match, there is an error

Parity Scheme 1-bit Parity Scheme Can detect at most 1 bit of error Cannot detect 2 bits of error Cannot correct an error

Error Correction Code (ECC) Can correct certain errors Requires more bits 7 bits for 64-bit word 8 bits for 128-bit word Most computers use ECC for Detection of 2 bits of error Correction of 1 bit of error

What I want you to do Review Appendix B