Washington University

Slides:



Advertisements
Similar presentations
Synchronous Static Random Access Memory (SSRAM). Internal Structure of a SSRAM AREG: Address Register CREG: Control Register INREG: Input Register OUTREG:
Advertisements

CS 367 – Introduction to Data Structures
COEN 180 SRAM. High-speed Low capacity Expensive Large chip area. Continuous power use to maintain storage Technology used for making MM caches.
Chapter 5 Internal Memory
Dynamic Memory Allocation (also see pointers lectures) -L. Grewe.
Spring 2006CS 685 Network Algorithmics1 Principles in Practice CS 685 Network Algorithmics Spring 2006.
LOGO.  Concept:  Is read-only memory.  Do not lose data when power is lost.  ROM memory is used to produce chips with integrated.
These slides incorporate figures from Digital Design Principles and Practices, third edition, by John F. Wakerly, Copyright 2000, and are used by permission.
1 DIGITAL DESIGN I DR. M. MAROUF MEMORY Read-only memories Static read/write memories Dynamic read/write memories Author: John Wakerly (CHAPTER 10.1 to.
Memory Basics. 8-1 Memory definitions Memory is a collection of cells capable of storing binary information. Two types of memory: –Random-Access Memory.
EECS150 Fall 2000 Checkpoint #1 Wire-wrap, SRAM, and FIFO Design by Ramakrishna Gummadi Norm Zhou.
Queue using an array. .head.tail Pointers head and tail always point to the first empty slot before or after elements in the list. Thus, initially they.
Chapter 10 Switching Fabrics. Outline Physical Interconnection Physical box with backplane Individual blades plug into backplane slots Each blade contains.
Lists: array implementation list_size = 5 lst Obj 1Obj 2Obj 3Obj 4Obj 5.
12/13/99 Page 1 IRAM Network Interface Ioannis Mavroidis IRAM retreat January 12-14, 2000.
ECE 301 – Digital Electronics
Paper Review Building a Robust Software-based Router Using Network Processors.
Data Structures - Queues
CS/CoE 536 : Lockwood 1 CS/CoE 536 Reconfigurable System On Chip Design Lecture 9 : MP3 Working Draft Washington University Fall 2002
ECE 371 Microprocessor Interfacing Unit 4 - Introduction to Memory Interfacing.
Basic Architecture Lecture 15. In general, if the number of bits is n, then the number of different combinations of 0s and 1s that can be made is 2 n.
Addressing Queuing Bottlenecks at High Speeds Sailesh Kumar Patrick Crowley Jonathan Turner.
CS/CoE 536 : Lockwood 1 CS/CoE 536 Reconfigurable System On Chip Design Lecture 4 : Demonstration of Machine Problem 1 : CAM-based Firewall Washington.
Extensible Networking Platform Lockwood / Zuver - Applied Research Laboratory -- Extensible Networking Development of a System-On-Chip Extensible.
Queues, Pipes and Sockets. QUEUE A structure with a series of data elements with the first element waiting for an operation Used when an element is not.
CS/CoE 536 : Lockwood 1 Project Integration : In order to ensure that projects can be integrated at the end of the semester, a few rules have been developed.
Lecture 13: Reconfigurable Computing Applications October 10, 2013 ECE 636 Reconfigurable Computing Lecture 11 Reconfigurable Computing Applications.
Intro  Scratchpad rings and queues.  First – In – Firs – Out (FIFO) data structure.  Rings are fixed-sized, circular FIFO.  Queues not fixed-size.
Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 122 – Data Structures Data Structures Queues.
Field Programmable Port Extender (FPX) 1 Modular Design Techniques for the FPX.
Copyright  2005 SRC Computers, Inc. ALL RIGHTS RESERVED Overview.
CS/CoE 536 : Lockwood 1 CS/CoE 536 Reconfigurable System On Chip Design Lecture 7 : Demonstration of Machine Problem 2 : SPAM FILTER Washington University.
Feb. 26, 2001Systems Architecture I1 Systems Architecture I (CS ) Lecture 12: State Elements, Registers, and Memory * Jeremy R. Johnson Mon. Feb.
Chapter 16 – Data Structures and Recursion. Data Structures u Built-in –Array –struct u User developed –linked list –stack –queue –tree Lesson 16.1.
Subject Name : Data Structure Using C Title : Linked Lists
Queue Manager and Scheduler on Intel IXP John DeHart Amy Freestone Fred Kuhns Sailesh Kumar.
CS/CoE 536 : Lockwood 1 Step 1 : Submit Project Information Visit : –Provide Project.
July 2, 2001Systems Architecture I1 Systems Architecture II (CS 282) Lab 3: State Elements, Registers, and Memory * Jeremy R. Johnson Monday July 2, 2001.
CS/CoE 536 : Lockwood 1 CS/CoE 536 Reconfigurable System On Chip Design Lecture 11 : Priority and Per-Flow Queuing in Machine Problem 3 (Revision 2) Washington.
Logic and Computer Design Fundamentals, Fifth Edition Mano | Kime | Martin Copyright ©2016, 2008, 2004 by Pearson Education, Inc. All rights reserved.
1 A Deficit Round Robin 20MB/s Layer 2 Switch Muraleedhara Navada Francois Labonte.
Field Programmable Port Extender (FPX) 1 Modular Design Techniques for the Field Programmable Port Extender John Lockwood and David Taylor Washington University.
CS/CoE 536 : Lockwood 1 CS/CoE 536 Reconfigurable System On Chip Design Lecture 10 : MP3 Working Draft Washington University Fall 2002
Appendix B The Basics of Logic Design
Washington University
7-5 DRAM ICs High storage capacity Low cost
Top 50 Data Structures Interview Questions
Flow Stats Module James Moscola September 12, 2007.
Lectures Queues Chapter 8 of textbook 1. Concepts of queue
MEMORY/SRAM SIMULATOR LAB
Design of a Diversified Router: Memory Usage
Washington University
Washington University
4.6 Data Structures for relations and digraphs
Flow Stats Module James Moscola September 6, 2007.
Key Difference between Manual Testing and Model Checking
كيــف تكتـب خطـة بحـث سيئـة ؟؟
الدكتـور/ عبدالناصـر محمـد عبدالحميـد
إستراتيجيات ونماذج التقويم
Queue and Priority Queue Implementations
Washington University in St. Louis
Queues: Implemented using Arrays
Memory Basics Chapter 8.
A List Implementation That Links Data
CSCE 206 Lab Structured Programming in C
Memory Basics Chapter 7.
Key Difference between Manual Testing and Concolic/Symbolic Testing
Objective- To graph a relationship in a table.
FIGURE 7-1 Block Diagram of Memory
A List Implementation That Links Data
Presentation transcript:

Washington University CS/CoE 536 Reconfigurable System On Chip Design Lecture 9 : MP3 Working Draft Washington University Fall 2002 http://www.arl.wustl.edu/~lockwood/class/cs536/ John Lockwood Copyright 2002 Lockwood@arl.wustl.edu

Flow Pointer Initialization in SRAM Set up a head/tail pointer pair for all possible FlowIDs (16 bits) Every head/tail pointer must be unique. Head Pointer: x0 Tail Pointer: Packet Reads = 0 Packet Writes Head Pointer: x2 Tail Pointer: Packet Reads = 0 Packet Writes Head Pointer: x4 Tail Pointer: Packet Reads = 0 Packet Writes Head Pointer: x6 Tail Pointer: Packet Reads = 0 Packet Writes Head Pointer: xFFFE Tail Pointer: Packet Reads = 0 Packet Writes SRAM ADDR: FlowID & “00” SRAM ADDR: FlowID & “01” SRAM ADDR: FlowID & “10” Head Pointer: x1 Tail Pointer: Packet Reads = 0 Packet Writes Head Pointer: x3 Tail Pointer: Packet Reads = 0 Packet Writes Head Pointer: x5 Tail Pointer: Packet Reads = 0 Packet Writes Head Pointer: 7 Tail Pointer: Packet Reads = 0 Packet Writes Head Pointer: xFFFF Tail Pointer: Packet Reads = 0 Packet Writes SRAM ADDR: FlowID & “11”

Flow Pointer Initialization in SRAM Points to loaction in SDRAM Points to Location in SDRAM. It is intialized when reset_l=‘0’ to FlowID FlowID (16 bit) SRAM Address (18 bit) SRAM Data (32 bit) Queue Context Function Head Pointer 1 Packet Reads 2 Packet Writes 3 Tail Pointer 4 5 6 7 8

Others Issues with Flow Management .. Memory Contention Flow is empty when “Packet Writes” = “Packet Reads” Input: Flow must be added to output queue. Output: Flow must be removed from output queue.