1 / 23

Group Members: Anderson Raid Marie Beltrao Raphael Christian

Reconfigurable Computing Using Content Addressable Memory (CAM) for Improved Performance and Resource Usage. Group Members: Anderson Raid Marie Beltrao Raphael Christian. Outline. Introduction – Literature Review Coarse Grain CAM Objectives of the paper CAM based computing scheme

daria
Télécharger la présentation

Group Members: Anderson Raid Marie Beltrao Raphael Christian

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


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

  2. Outline • Introduction – Literature Review • Coarse Grain • CAM • Objectives of the paper • CAM based computing scheme • MCB – hardware • Multi-MCB Communication • Application Mapping Process • Estimation of Cycle time and performance • Design and Organization of a Ternary CAM (T CAM) • Hybrid CAM-LUT • MCB - Delay and power components • SIMULATION RESULTS

  3. Introduction – Literature Review • Traditional FPGA > Significant design overhead and poor scalability with process technology > LUT > 80% or more of power >> programmable interconnects • Multi-cycle Memory Based > Reduction in memory requirement > Little or no degradation in performance > CAM

  4. Introduction – Literature Review • Fine grain x coarse grain • Fine control over bit-width • Bit-level operations • CAD tools Available • Flexible • Speed, Power Consumption • Time to Configure Less Routing. • Better Instruction Density. • Better cycle times. • Small configuration sizes. • Little CAD support • Less flexible!

  5. Introduction – Literature Review Why coarse grain? • In order to achieve improvement in both performance and reliability of operation • Significantly reduce the configuration memory and time • Improve routing overhead and poor routability • Improve area and delay by minimizing the contribution of the programmable interconnects. • Spacial Computing + Multi-cycled Computing • (LUT) trade off (CAM)

  6. Introduction – Literature Review What is CAM? • “Content Addressable Memory” • word length ranging from 36 to 144 bits • address space from 7 to 15 bits • access times as low as 0.25ns Embedded System Block (ESB) of the APEX20K from Altera Corporation incorporates such an embedded memory!! But cannot exploit the optimization obtained by consideration of don’t care terms

  7. Objective of the paper Implement “(…) a multi-cycle Memory Based Computational methodology that utilizes Content Addressable Memory (CAM) as the underlying reconfigurable fabric” • Implement a large application efficiently • Proposes a CAM-based implementation of reconfigurable computing. • Discusses the circuit implementation and develops a scalable hardware framework that allows mapping of a large design to multiple computational units. • Proposes a hybrid LUT-CAM based function representation that can further optimize the memory requirement by selectively storing some partitions in CAM, while the others in LUT.

  8. CAM based computing scheme Storages functional responses

  9. MCB – hardwareMemory-based Computational Block • Store and evaluate up to 128 partitions, 32 in each bank, with each partition having 12 inputs and outputs.

  10. Multi-MCB Communication Functional block diagram for memory based computing

  11. Multi-MCB Communication • A MCB node alone has limited memory resource = scalability restrictions for larger applications • Multi-MCB communication tend to minimize interconnect overhead • Hierarchical interconnect architecture

  12. Application Mapping Process • Partitioning • Greedy heuristic-based portioning approach = multi input-output logic blocks • It’s an optimization problem = evaluation time as objective and memory requirement as constrain

  13. Application Mapping Process • Partitioning

  14. Application Mapping Process • Scheduling • Multi-cycle evaluation at each MCB = heuristic-based algorithm for scheduling the execution of the partitions • Static Scheduling • Minimize the number of evaluation cycles

  15. Estimation of Cycle time and performance • Simulations were carried out using 70nm technology model • It estimated cycle time for a LUT based MCB framework • Improvement of 56.3% in processing time • Cost of 23.6% increase in the energy/vector

  16. Estimation of Cycle time and performance

  17. Estimation of Cycle time and performance • The Performance improvement offered by the proposed framework was also validated for two algorithm-specific applications: • DCT: Discrete Cosine Transform • FIR: Finite Impulse Response

  18. Design and Organization of a Ternary CAM (T CAM) • Allows pattern matching with the use of “don’t cares.” • Attractive for implementing longest-prefix-match searches in routing tables

  19. Hybrid CAM-LUT • The proposed framework contain both PLA and LUT based representation and is advantageous for memory-efficient realization of all classes of function (hybrid CAM/LUT-based). • A hybrid approach can potentially improve the total memory requirement.

  20. MCB - Delay and power components

  21. SIMULATION RESULTS

  22. SIMULATION RESULTS

  23. Questions? Thank you!

More Related