Presentation is loading. Please wait.

Presentation is loading. Please wait.

Packet Features are enhanced packet management controls (Mark, Restore and Release functions) that facilitate packet retransmission or receive packet discard.

Published byMarybeth Alexander Modified over 9 years ago

Similar presentations

Presentation on theme: "Packet Features are enhanced packet management controls (Mark, Restore and Release functions) that facilitate packet retransmission or receive packet discard."— Presentation transcript:

1 Packet Features are enhanced packet management controls (Mark, Restore and Release functions) that facilitate packet retransmission or receive packet discard functionality. Packet FIFO designs utilize a single synchronous clock domain for the input and output sides. Packet FIFO Q & A

2 Four Configurations of PLB IPIF SW reset/ MIR Packet FIFOs Packet Features WrFIFO DRE support Interrupt Service Burst Service Master Service SESR/ SEAR Simple DMA DMA/ Scatter Gather Wishful Config Reason- abel Config Bare- bone Config_ 1 Bare- bone Config_ 2

3 Wishful Configuration Device utilization summary: --------------- Selected Device : 2vp100ff1704-6 Number of Slices: 2147 out of 44096 4% Number of Slice Flip Flops: 2092 out of 88192 2% Number of 4 input LUTs: 3844 out of 88192 3% Number of bonded IOBs: 758 out of 1040 72% Number of BRAMs: 4 out of 444 0% Number of GCLKs: 1 out of 16 6% Timing Summary: --------------- Speed Grade: -6 Minimum period: 9.041ns (Maximum Frequency: 110.607MHz) Minimum input arrival time before clock: 7.528ns Maximum output required time after clock: 7.122ns Maximum combinational path delay: 6.753ns

4 Reasonable Configuration Device utilization summary: --------------- Selected Device : 2vp100ff1704-6 Number of Slices: 1797 out of 44096 3% Number of Slice Flip Flops: 1806 out of 88192 1% Number of 4 input LUTs: 3261 out of 88192 3% Number of bonded IOBs: 752 out of 1040 72% Number of BRAMs: 4 out of 444 0% Number of GCLKs: 1 out of 16 6% Timing Summary: --------------- Speed Grade: -6 Minimum period: 8.645ns (Maximum Frequency: 115.680MHz) Minimum input arrival time before clock: 7.519ns Maximum output required time after clock: 7.257ns Maximum combinational path delay: 6.489ns

5 Barebone 1 Configuration Device utilization summary: --------------- Selected Device : 2vp100ff1704-6 Number of Slices: 375 out of 44096 0% Number of Slice Flip Flops: 592 out of 88192 0% Number of 4 input LUTs: 543 out of 88192 0% Number of bonded IOBs: 541 out of 1040 52% Number of BRAMs: 4 out of 444 0% Number of GCLKs: 1 out of 16 6% Timing Summary: --------------- Speed Grade: -6 Minimum period: 6.385ns (Maximum Frequency: 156.617MHz) Minimum input arrival time before clock: 6.666ns Maximum output required time after clock: 6.915ns Maximum combinational path delay: 6.208ns

6 Barebone 2 Configuration Device utilization summary: --------------- Selected Device : 2vp100ff1704-6 Number of Slices: 338 out of 44096 0% Number of Slice Flip Flops: 546 out of 88192 0% Number of 4 input LUTs: 465 out of 88192 0% Number of bonded IOBs: 537 out of 1040 51% Number of BRAMs: 4 out of 444 0% Number of GCLKs: 1 out of 16 6% Timing Summary: --------------- Speed Grade: -6 Minimum period: 6.359ns (Maximum Frequency: 157.270MHz) Minimum input arrival time before clock: 6.467ns Maximum output required time after clock: 6.915ns Maximum combinational path delay: 6.184ns

Download ppt "Packet Features are enhanced packet management controls (Mark, Restore and Release functions) that facilitate packet retransmission or receive packet discard."

Similar presentations

1 A latch is a pair of cross-coupled inverters –They can be NAND or NOR gates as shown –Consider their behavior (each step is one gate delay in time) –From.

1 A latch is a pair of cross-coupled inverters –They can be NAND or NOR gates as shown –Consider their behavior (each step is one gate delay in time) –From.
Spartan-3 FPGA HDL Coding Techniques

Spartan-3 FPGA HDL Coding Techniques
Galen SasakiEE 260 University of Hawaii1 Building D Flip Flops Combinational circuit components D Clocked Latch: similar to a flip flop but simpler D flip.

Galen SasakiEE 260 University of Hawaii1 Building D Flip Flops Combinational circuit components D Clocked Latch: similar to a flip flop but simpler D flip.
1 Introduction Sequential circuit –Output depends not just on present inputs (as in combinational circuit), but on past sequence of inputs Stores bits,

1 Introduction Sequential circuit –Output depends not just on present inputs (as in combinational circuit), but on past sequence of inputs Stores bits,
Basic FPGA Architecture 2 - 2 © 2005 Xilinx, Inc. All Rights Reserved For Academic Use Only Virtex-II Architecture Virtex™-II architecture’s core voltage.

Basic FPGA Architecture © 2005 Xilinx, Inc. All Rights Reserved For Academic Use Only Virtex-II Architecture Virtex™-II architecture’s core voltage.
VirtexII 3000 FPGA Dynamic Burn-In Test For Military And Aerospace Applications Sponsored By NASA Electronic Parts and Packaging Program (NEPP) Electronic.

VirtexII 3000 FPGA Dynamic Burn-In Test For Military And Aerospace Applications Sponsored By NASA Electronic Parts and Packaging Program (NEPP) Electronic.
George Mason University FPGA Design Flow ECE 448 Lecture 9.

George Mason University FPGA Design Flow ECE 448 Lecture 9.
1 Lecture 28 Timing Analysis. 2 Overview °Circuits do not respond instantaneously to input changes °Predictable delay in transferring inputs to outputs.

1 Lecture 28 Timing Analysis. 2 Overview °Circuits do not respond instantaneously to input changes °Predictable delay in transferring inputs to outputs.
Spartan II Features  Plentiful logic and memory resources –15K to 200K system gates (up to 5,292 logic cells) –Up to 57 Kb block RAM storage  Flexible.

Spartan II Features  Plentiful logic and memory resources –15K to 200K system gates (up to 5,292 logic cells) –Up to 57 Kb block RAM storage  Flexible.
Synchronous Digital Design Methodology and Guidelines

Synchronous Digital Design Methodology and Guidelines
Assume array size is 256 (mult: 4ns, add: 2ns)

Assume array size is 256 (mult: 4ns, add: 2ns)
Jet algorithm/FPGA by Attila Hidvégi. Content Jet algorithm Jet-FPGA – Changes – Results – Analysing the inputs Tests at RAL Summary and Outlook.

Jet algorithm/FPGA by Attila Hidvégi. Content Jet algorithm Jet-FPGA – Changes – Results – Analysing the inputs Tests at RAL Summary and Outlook.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Dr. Shi Dept. of Electrical and Computer Engineering.

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Dr. Shi Dept. of Electrical and Computer Engineering.
ENGIN112 L28: Timing Analysis November 7, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 28 Timing Analysis.

ENGIN112 L28: Timing Analysis November 7, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 28 Timing Analysis.
Reliable Data Storage using Reed Solomon Code Supervised by: Isaschar (Zigi) Walter Performed by: Ilan Rosenfeld, Moshe Karl Spring 2004 Part A Final Presentation.

Reliable Data Storage using Reed Solomon Code Supervised by: Isaschar (Zigi) Walter Performed by: Ilan Rosenfeld, Moshe Karl Spring 2004 Part A Final Presentation.
Double buffer SDRAM Memory Controller Presented by: Yael Dresner Andre Steiner Instructed by: Michael Levilov Project Number: D0713.

Double buffer SDRAM Memory Controller Presented by: Yael Dresner Andre Steiner Instructed by: Michael Levilov Project Number: D0713.
The Spartan 3e FPGA. CS/EE 3710 The Spartan 3e FPGA  What’s inside the chip? How does it implement random logic? What other features can you use?  What.

The Spartan 3e FPGA. CS/EE 3710 The Spartan 3e FPGA  What’s inside the chip? How does it implement random logic? What other features can you use?  What.
1 FPGA Lab School of Electrical Engineering and Computer Science Ohio University, Athens, OH 45701, U.S.A. An Entropy-based Learning Hardware Organization.

1 FPGA Lab School of Electrical Engineering and Computer Science Ohio University, Athens, OH 45701, U.S.A. An Entropy-based Learning Hardware Organization.
SADDAPALLI RUDRA ABHISHEK

SADDAPALLI RUDRA ABHISHEK
Reliable Data Storage using Reed Solomon Code Supervised by: Isaschar (Zigi) Walter Performed by: Ilan Rosenfeld, Moshe Karl Spring 2004 Midterm Presentation.

Reliable Data Storage using Reed Solomon Code Supervised by: Isaschar (Zigi) Walter Performed by: Ilan Rosenfeld, Moshe Karl Spring 2004 Midterm Presentation.

Similar presentations

Ads by Google