Concepts of System Design

Slides:



Advertisements
Similar presentations
UNIT 2: Data Flow description
Advertisements

Computer Architecture
Figure (a) 8 * 8 array (b) 16 * 8 array.
Delivery and Forwarding of
NAND-gate Latch. Summary NAND-gate Latch The time sequence at right shows the conditions under which the set and reset inputs cause a state change, and.
Topic 9 MOS Memory and Storage Circuits
ENGIN112 L30: Random Access Memory November 14, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 30 Random Access Memory (RAM)
Lecture 4: Computer Memory
CS 151 Digital Systems Design Lecture 30 Random Access Memory (RAM)
The importance of switching in communication The cost of switching is high Definition: Transfer input sample points to the correct output ports at the.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Hao Ji.
TCP/IP Protocol Suite 1 Chapter 6 Upon completion you will be able to: Delivery, Forwarding, and Routing of IP Packets Understand the different types of.
TCP/IP Protocol Suite 1 Chapter 6 Upon completion you will be able to: Delivery, Forwarding, and Routing of IP Packets Understand the different types of.
TCP/IP Protocol Suite 1 Chapter 6 Upon completion you will be able to: Delivery, Forwarding, and Routing of IP Packets Understand the different types of.
SAP1 (Simple-As-Possible) Computer
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
Networks-on-Chips (NoCs) Basics
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Combinational vs.
COMPUTER SCIENCE Data Representation and Machine Concepts Section 1.2 Instructor: Lin Chen August 2013.
Chapter 4 The Von Neumann Model
Topics to be covered : How to model memory in Verilog RAM modeling Register Bank.
Routers. These high-end, carrier-grade 7600 models process up to 30 million packets per second (pps).
Packet Forwarding. A router has several input/output lines. From an input line, it receives a packet. It will check the header of the packet to determine.
Computer Architecture Lecture 24 Fasih ur Rehman.
A Dynamic Longest Prefix Matching Content Addressable Memory for IP Routing Author: Satendra Kumar Maurya, Lawrence T. Clark Publisher: IEEE TRANSACTIONS.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /3/2013 Lecture 9: Memory Unit Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL.
Von Neumann Model Computer Organization I 1 September 2009 © McQuain, Feng & Ribbens The Stored Program Computer 1945: John von Neumann –
Memory Devices 1. Memory concepts 2. RAMs 3. ROMs 4. Memory expansion & address decoding applications 5. Magnetic and Optical Storage.
18-WAN Technologies and Dynamic routing Dr. John P. Abraham Professor UTPA.
07/11/2005 Register File Design and Memory Design Presentation E CSE : Introduction to Computer Architecture Slides by Gojko Babić.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 24: November 5, 2012 Synchronous Circuits.
RAM RAM - random access memory RAM (pronounced ramm) random access memory, a type of computer memory that can be accessed randomly;
Behrouz A. Forouzan TCP/IP Protocol Suite, 3rd Ed.
Lecture 3. Lateches, Flip Flops, and Memory
Memories.
Class Exercise 1B.
COMP211 Computer Logic Design
Lecture 19: SRAM.
Recap DRAM Read Cycle DRAM Write Cycle FAST Page Access Mode
Computer Architecture & Operations I
Chapter 4 The Von Neumann Model
Full Custom Associative Memory Core
Packet Forwarding.
Morgan Kaufmann Publishers
Chapter 4 The Von Neumann Model
Introduction to Computer Engineering
Computer Architecture & Operations I
Chapter 4 The Von Neumann Model
Chapter 4 The Von Neumann Model
Interfacing Memory Interfacing.
EE345: Introduction to Microcontrollers Memory
Day 29: November 11, 2013 Memory Core: Part 1
Delivery, Forwarding, and Routing of IP Packets
Day 21: October 29, 2010 Registers Dynamic Logic
The 8085 Microprocessor Architecture
Electronics for Physicists
Chapter 4 The Von Neumann Model
Chapter 8 MOS Memory and Storage Circuits
Sequential Logic.
Delivery, Forwarding, and Routing of IP Packets
AKT211 – CAO 07 – Computer Memory
The Stored Program Computer
The SDRAM Controller EECS150 Fall Lab Lecture #8 Chen Sun
Review: The whole processor
Introduction to Computer Engineering
Introduction to Computer Engineering
Introduction to Computer Engineering
4-Bit Register Built using D flip-flops:
Introduction to Computer Engineering
Chapter 4 The Von Neumann Model
Presentation transcript:

Concepts of System Design The example used here is a Bit-pattern associative router. It has components that include: Input and Output Ports Routing and Arbitration module The Switch as well as local node circuitry The idea is to understand what the system requirements are and what each component’s fuction is. In this case we design just the routing and arbitration unit Its function is to get the message header and determine the appropriate route the message must follow to reach its destination.

Router Architecture ports output ports switch local node input routing & arbitration

Associative router scheme output port destination address priority routing function port assignment Selection function

General routing function destination address c2 c1 c0 this node x x c0 x port x c1 c0 y port z port X = don’t care

Routing function IF cond THEN assign(out_put) Cond =

Case statement IF cond1 THEN assign(out_port1) ELSE IF cond2 THEN assign(out_port2) ELSE IF cond3 THEN assign(out_port3) . ELSE IF condN THEN assign(out_portN)

Router organization Normal operation row select destination address to switching network Search argument register Bit-Pattern (DCAM) Refresh (DCAM) selection function (SF) Port assignment Register no match Refresh (DRAM) (from input port) (output port) Port Associative Assignment Unit (DRAM) The Blue Rows indicate matching words/addresses and Only one is selected and routed

Programming mode Program Data Program Data (Current Address) (Output Port Assignment) Search argument register Input Latch Input Latch Port assignment Register Bit-Pattern selection function (SF) row select (DCAM) row select Refresh (DCAM) no match Refresh (DRAM) The row select, selects a word to write to and the action is the same for both the Dynamic Content Addressable Memory (CAM) and the Dynamic RAM (DRAM)

Basic element of the bit-pattern associative unit One of many flavors Of dynamic CAM Bit Bit write sb1 sb0 read Match line Evaluate

Tenary digit stored in the DCAM cell Sb1 Sb0 state X(don’t care) 1 1(one) 0(zero) Not allowed

Basic cell of the selection function w/o priority lookahead

4-bit encoder w/o lookahead

Basic cell of the selection function with priority lookahead

4-bit priority lookahead encoder

The Refresh Basic Cell DCAM Refresh Good For DRAM too Bit Bit read read VDD VDD write write C2MOS Refresh Register

Timing Operation Match Operation Timing Sequence F1 F2 T21 T12 Get input 1 Latch & pass input 1 to bit lines input 2 input 3 input 4 2 to bit lines Input Latch operation Matching Unit (DCAM) operation (timing events) Priority Encoder operation (timing events) Output port activity Two phase clocking Read & refresh data Compare 1 input to stored data. Evaluate matchline @ T21 & F2 Write data back after refreshing (@ T21 & F1 Compare 2 input to stored data. Evaluate matchline @ T21 & F2 Precharge bitlines Compare 3 input to stored data. Evaluate matchline @ T21 & F2 Reset priority encoder DRAM Select ignored Precharge priority line Get Match Select DRAM Precharge DRAM bitlines Read data 1 from selected row, latch data. @ F2 send data out Read data 2 from selected row, latch data. @ F2 send data out