Reconfigurable Architectures. 2 Granularity of Reconfigurable Systems Granularity:  The abstraction level used to configure the device.  May use a −Boolean-level,

Slides:

Advertisements

Similar presentations

1 Computational Complexity Size Matters!. 2 Suppose there are several algorithms which can all be used to perform the same task. We need some way to judge.

Advertisements

© 2003 Xilinx, Inc. All Rights Reserved Course Wrap Up DSP Design Flow.

Computer Science and Engineering Laboratory, Transport-triggered processors Jani Boutellier Computer Science and Engineering Laboratory This.

Adding the Jump Instruction

Commercial FPGAs: Altera Stratix Family Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.

RISC and Pipelining Prof. Sin-Min Lee Department of Computer Science.

TIE Extensions for Cryptographic Acceleration Charles-Henri Gros Alan Keefer Ankur Singla.

ECE 734: Project Presentation Pankhuri May 8, 2013 Pankhuri May 8, point FFT Algorithm for OFDM Applications using 8-point DFT processor (radix-8)

Parallell Processing Systems1 Chapter 4 Vector Processors.

A Survey of Logic Block Architectures For Digital Signal Processing Applications.

Lecture 9: Coarse Grained FPGA Architecture October 6, 2004 ECE 697F Reconfigurable Computing Lecture 9 Coarse Grained FPGA Architecture.

1 Lecture-2 CSIT-120 Spring 2001 Revision of Lecture-1 Introducing Computer Architecture The FOUR Main Elements Fetch-Execute Cycle A Look Under the Hood.

Reconfigurable Computing: What, Why, and Implications for Design Automation André DeHon and John Wawrzynek June 23, 1999 BRASS Project University of California.

Week 1- Fall 2009 Dr. Kimberly E. Newman University of Colorado.

Zheming CSCE715.  A wireless sensor network (WSN) ◦ Spatially distributed sensors to monitor physical or environmental conditions, and to cooperatively.

PipeRench: A Coprocessor for Streaming Multimedia Acceleration Seth Goldstein, Herman Schmit et al. Carnegie Mellon University.

Instruction Level Parallelism (ILP) Colin Stevens.

Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day10: October 25, 2000 Computing Elements 2: Cascades, ALUs,

A High Performance Application Representation for Reconfigurable Systems Wenrui GongGang WangRyan Kastner Department of Electrical and Computer Engineering.

Design of a Reconfigurable Hardware For Efficient Implementation of Secret Key and Public Key Cryptography.

Storage Assignment during High-level Synthesis for Configurable Architectures Wenrui Gong Gang Wang Ryan Kastner Department of Electrical and Computer.

1 Lecture-2 CS-120 Fall 2000 Revision of Lecture-1 Introducing Computer Architecture The FOUR Main Elements Fetch-Execute Cycle A Look Under the Hood.

RISC. Rational Behind RISC Few of the complex instructions were used –data movement – 45% –ALU ops – 25% –branching – 30% Cheaper memory VLSI technology.

 Y. Hu, V. Shih, R. Majumdar and L. He, “Exploiting Symmetries to Speedup SAT-based Boolean Matching for Logic Synthesis of FPGAs”, TCAD  Y. Hu,

Trends toward Spatial Computing Architectures Dr. André DeHon BRASS Project University of California at Berkeley.

ICCAD’01: November, 2001 Instruction Generation for Hybrid Reconfigurable Systems Ryan Kastner, Seda Ogrenci-Memik, Elaheh Bozorgzadeh and Majid Sarrafzadeh.

HW/SW Co-Synthesis of Dynamically Reconfigurable Embedded Systems HW/SW Partitioning and Scheduling Algorithms.

The Processor Andreas Klappenecker CPSC321 Computer Architecture.

Lecture 2: Field Programmable Gate Arrays September 13, 2004 ECE 697F Reconfigurable Computing Lecture 2 Field Programmable Gate Arrays.

A Bit-Serial Method of Improving Computational Efficiency of Dot-Products 1.

Reconfigurable Computing. Lect-02.2 Course Schedule Introduction to Reconfigurable Computing FPGA Technology, Architectures, and Applications FPGA Design.

A RISC ARCHITECTURE EXTENDED BY AN EFFICIENT TIGHTLY COUPLED RECONFIGURABLE UNIT Nikolaos Vassiliadis N. Kavvadias, G. Theodoridis, S. Nikolaidis Section.

Automated Design of Custom Architecture Tulika Mitra

Designing the WRAMP Dean Armstrong The University of Waikato.

ASIP Architecture for Future Wireless Systems: Flexibility and Customization Joseph Cavallaro and Predrag Radosavljevic Rice University Center for Multimedia.

Implementation of Finite Field Inversion

J. Christiansen, CERN - EP/MIC

FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n FPGA fabric architecture concepts.

Reconfigurable Computing Using Content Addressable Memory (CAM) for Improved Performance and Resource Usage Group Members: Anderson Raid Marie Beltrao.

Ramesh.B ELEC 6200 Computer Architecture & Design Fall /29/20081Computer Architecture & Design.

EE3A1 Computer Hardware and Digital Design

1 - CPRE 583 (Reconfigurable Computing): Reconfigurable Computing Architectures Iowa State University (Ames) Reconfigurable Architectures Forces that drive.

EKT303/4 PRINCIPLES OF PRINCIPLES OF COMPUTER ARCHITECTURE (PoCA)

COARSE GRAINED RECONFIGURABLE ARCHITECTURES 04/18/2014 Aditi Sharma Dhiraj Chaudhary Pruthvi Gowda Rachana Raj Sunku DAY

Implementing and Optimizing a Direct Digital Frequency Synthesizer on FPGA Jung Seob LEE Xiangning YANG.

FPGA-Based System Design: Chapter 1 Copyright  2004 Prentice Hall PTR Moore’s Law n Gordon Moore: co-founder of Intel. n Predicted that number of transistors.

1  1998 Morgan Kaufmann Publishers Where we are headed Performance issues (Chapter 2) vocabulary and motivation A specific instruction set architecture.

EKT303/4 Superscalar vs Super-pipelined.

1 Advanced Digital Design Reconfigurable Logic by A. Steininger and M. Delvai Vienna University of Technology.

WARP PROCESSORS ROMAN LYSECKY GREG STITT FRANK VAHID Presented by: Xin Guan Mar. 17, 2010.

Mapping of Regular Nested Loop Programs to Coarse-grained Reconfigurable Arrays – Constraints and Methodology Presented by: Luis Ortiz Department of Computer.

1 - CPRE 583 (Reconfigurable Computing): Reconfigurable Computing Architectures Iowa State University (Ames) CPRE 583 Reconfigurable Computing Lecture.

Lecture 17: Dynamic Reconfiguration I November 10, 2004 ECE 697F Reconfigurable Computing Lecture 17 Dynamic Reconfiguration I Acknowledgement: Andre DeHon.

Reconfigurable Architectures Greg Stitt ECE Department University of Florida.

Winter-Spring 2001Codesign of Embedded Systems1 Essential Issues in Codesign: Architectures Part of HW/SW Codesign of Embedded Systems Course (CE )

System on a Programmable Chip (System on a Reprogrammable Chip)

1 Architecture of Datapath- oriented Coarse-grain Logic and Routing for FPGAs Andy Ye, Jonathan Rose, David Lewis Department of Electrical and Computer.

Topics Coarse-grained FPGAs. Reconfigurable systems.

Computer architecture and computer organization

CSCI206 - Computer Organization & Programming

Adaptive Computing Systems

Instructor: Dr. Phillip Jones

FPGAs in AWS and First Use Cases, Kees Vissers

Anne Pratoomtong ECE734, Spring2002

Leakage-Aware FPGA Re-synthesis

EEL 4713/EEL 5764 Computer Architecture

STUDY AND IMPLEMENTATION

Multiplier-less Multiplication by Constants

Figure 8.1 Architecture of a Simple Computer System.

微處理機 Microprocessor (100上) ARM 內核嵌入式SOC原理

Presentation transcript:

Reconfigurable Architectures

2 Granularity of Reconfigurable Systems Granularity:  The abstraction level used to configure the device.  May use a −Boolean-level, −instruction-level, −function-level, −process-level representation.

3 Granularity of Reconfigurable Systems Granularity:  Proportional to the length of a configuration: −Fine/low-grain: long configuration −Course grain (high-level granularity): short configuration Fine-grain (Boolean-level) architecture:  FPGA: −Primary computational elements: limited-input LUTs  Suitable for simple to complex Boolean functions. −Inefficient for complex functions like multipliers Instruction-level:  Has computational units that perform instruction-level operations  Units vary from byte-width to word-width (32-bit) datapath operations.  Units rarely have states: −Read from registers and written to registers  Efficient for performing instructions but inefficient at performing Boolean operations.

4 Granularity Freedom of device:  Instruction-level granularity only allows a limited number of register locations and small number of operations (on those locations)  Lower granularity level allows more locations and different complex customized FUs. −Can implement complex functions by a number of LUTs. Efficiency:  The more closely the application operation is matched to the granularity, the more efficient the device will execute. Example:  DSP application needs a lot of word-size add and mult. −  instruction-level granularity.  Application with a lot of Boolean operations: −  Boolean-level granularity.

5 Granularity Functional-level:  Units are complex multi-cycle operations −Extensible processors with customized instructions. Process-level:  Extremely complex processes which often take cycles to complete.  Example: −A cryptography device which decides on the algorithm based on the input key.

6 Hybrid Devices Recent commercial FPGA devices with multiple levels of granularity:  LUTs,  Dedicated adders/multipliers,  DSP units.

7 Granularity  Course-grained reconfigurable devices (rDPA)  Fine-grained reconfigurable devices (FPGA) [Hartenstein07]

8 Area Efficiency

9 References [Hartenstein07] Hartenstein, “Basics of Reconfigurable Computing,” S. P. J. Henkel, Ed. New York: Springer- Verlag, [Kastner04] Kastner, Kaplan, Sarrafzadeh, “Synthesis techniques and optimizations for reconfigurable systems,” Kluwer, 2004.