DREAM TEAM 2 Roto, Holiano, Chaka

Slides:



Advertisements
Similar presentations
Memory Section 7.2. Types of Memories Definitions – Write: store new information into memory – Read: transfer stored information out of memory Random-Access.
Advertisements

Decoders/DeMUXs CS370 – Spring Decoder: single data input, n control inputs, 2 outputs control inputs (called select S) represent Binary index of.
M. Mateen Yaqoob The University of Lahore Spring 2014.
Chapter 12 Memory Organization
The Lord of the Cache Project 3. Caches Three common cache designs: Direct-Mapped store in exactly one cache line Fully Associative store in any cache.
How caches take advantage of Temporal locality
Memory Hierarchies Exercises [ ] Describe the general characteristics of a program that would exhibit very little spatial or temporal locality with.
SADDAPALLI RUDRA ABHISHEK
Caches The principle that states that if data is used, its neighbor will likely be used soon.
S. Reda EN1600 SP’08 Design and Implementation of VLSI Systems (EN1600) Lecture 24: Computer-Aided Design using Tanner Tools Prof. Sherief Reda Division.
CSCE 212 Quiz 11 – 4/13/11 Given a direct-mapped cache with 8 one-word blocks and the following 32-bit memory address references: 1 2, ,
COEN 180 Main Memory Cache Architectures. Basics Speed difference between cache and memory is small. Therefore:  Cache algorithms need to be implemented.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 12 – Design Procedure.
Ultimate Design Review G. Bertolone, C. Colledani, A. Dorokhov, W. Dulinski, G. Dozière, A. Himmi, Ch. Hu-Guo, F. Morel, H. Pham, I. Valin, J. Wang, G.
Cache Physical Implementation Panayiotis Charalambous Xi Research Group Panayiotis Charalambous Xi Research Group.
Cache Control and Cache Coherence Protocols How to Manage State of Cache How to Keep Processors Reading the Correct Information.
Digital Logic Design Instructor: Kasım Sinan YILDIRIM
1 CMPE 421 Advanced Computer Architecture Accessing a Cache PART1.
Computer Architecture Lecture 26 Fasih ur Rehman.
MEMORY ORGANIZATION - Memory hierarchy - Main memory - Auxiliary memory - Cache memory.
Outline Cache writes DRAM configurations Performance Associative caches Multi-level caches.
11 Intro to cache memory Kosarev Nikolay MIPT Nov, 2009.
Virtual Memory Review Goal: give illusion of a large memory Allow many processes to share single memory Strategy Break physical memory up into blocks (pages)
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 22 Memory Definitions Memory ─ A collection of storage cells together with the necessary.
Additional Slides By Professor Mary Jane Irwin Pennsylvania State University Group 1.
3.13 How many output lines will a five-input decoder have?
CAM Content Addressable Memory
Cache Small amount of fast memory Sits between normal main memory and CPU May be located on CPU chip or module.
Memory Hierarchy and Cache Design (3). Reducing Cache Miss Penalty 1. Giving priority to read misses over writes 2. Sub-block placement for reduced miss.
نظام المحاضرات الالكترونينظام المحاضرات الالكتروني Cache Memory.
CSCI206 - Computer Organization & Programming
Translation Lookaside Buffer
Two Dimensional Highly Associative Level-Two Cache Design
Soner Onder Michigan Technological University
Tutorial Nine Cache CompSci Semester One 2016.
CS2100 Computer Organization
Lecture 19: SRAM.
Recap DRAM Read Cycle DRAM Write Cycle FAST Page Access Mode
CAM Content Addressable Memory
Full Custom Associative Memory Core
Meeting at CERN March 2011.
ADPCM Adaptive Differential Pulse Code Modulation
The Multiplexer Multi what?
Top-level Schematics Digital Block Sign-off Digital Model of Chip
Digital Components and Combinational Circuits
Consider a Direct Mapped Cache with 4 word blocks
Overview Part 1 – Design Procedure Beginning Hierarchical Design
Instructor: Prof. Levitan, Prof. Jones Student: Xinyu Yi
CS61C : Machine Structures Lecture 6. 2
Latches and Flip-flops
CSCI206 - Computer Organization & Programming
FIGURE 12-1 Memory Hierarchy
Set-Associative Cache
Interconnect with Cache Coherency Manager
Cache Replacement Scheme based on Back Propagation Neural Networks
Lecture 22: Cache Hierarchies, Memory
Help! How does cache work?
Direct Mapping.
Translation Lookaside Buffer
CSE 351: The Hardware/Software Interface
Memory Organization.
Miss Rate versus Block Size
April 3 Fun with MUXes Implementing arbitrary logical functions
13 Digital Logic Circuits.
Basic Cache Operation Prof. Eric Rotenberg
UNIT-III Pin Diagram Of 8086
Team Awesome += 5 PICo Design Presentation
Cache Memory and Performance
Advanced Computer Architecture Lecture 19
Presentation transcript:

DREAM TEAM 2 Roto, Holiano, Chaka DIRECT MAPPING CACHE DREAM TEAM 2 Roto, Holiano, Chaka

Block Diagram

Specifications 4 cache line Each line includes: 4bits tag, 2bits index, 8bits data Only Read or Write is allowed at one time Write Operation Address is decomposed into Tag, Line, Data 2bit lines are used for selecting cache line Tag and data are written to respected cache line Read Operation: Tag bits are read from the cache line and compared to the input If the tag is matched, then read outputs data and pulls the status signal up

Work plan System Design: Roto, Holiano, Chaka Memory cell and Cache line: Roto MUX-DEMUX: Holiano Comparator: Chaka System Integration: Roto-Holiano-Chaka Functional Verification: Roto-Holiano Layout check: Chaka

Memory cell

Tag Read/Write Tdf = 2.1ns Tdr = 2.3 ns

Demux 1to4

Mux 4to1

4bits Comparator

Integrated System

Read Miss Read hit

Read Miss Read hit

System with pad

Core = 2438.5λ x 1352.5λ

System Summary Frame size in Lambda : 5000.00 x 5000.00 Length of nets in core : 170751.00 Lambda Number of Metal layer: 2 Generated vias in core : 635 Number of standard cells : 184 Number of signals in netlist : 336 Read time: tdf = 17ns tdr = 9ns

Conclusion The system work well and matches the functional specifications The system is simple, should have more functions All team have worked well in cooperation More than 60% of design time is for functional verification We have successfully designed and implemented a digital system from transistor level to layout