Application-Specific Memory Interleaving for FPGA-Based Grid Computations: A General Design Technique

  • Tom Vancourt
  • Martin Herbordt
ORKG logo Add to ORKG
Publication date
February 2015

Abstract

Many compute-intensive applications generate single result values by accessing clusters of nearby points in grids of one, two, or more dimensions. Often, the performance of FGPA implementations of such algorithms would benefit from concurrent, non-interfering access to all points in each cluster. When clusters contain dozens of points and access patterns are irregular, multiported memories are infeasible and vector-oriented approaches are inapplicable. Instead, the grid points may be distributed across multiple interleaved memory banks so that, when accessing any cluster, each point comes from a different memory bank. We present a general technique based on the application’s multidimensional indexing rather than linearized memory addresses....

Extracted data

Related items

Application-Specific Memory Interleaving for FPGA-Based Grid Computations: A General Design Technique
  • Tom Vancourt
  • Martin C. Herbordt
April 2015

Current generations of FPGAs create possibilities for innovative, application-specific computation p...

Memory mapping for multi-die FPGAs
  • Voss, N
  • Quintana, P
  • Mencer, O
  • Luk, W
  • Gaydadjiev, G
March 2019

This paper proposes an algorithm for mappinglogical to physical memory resources on Field-Programmab...

Exploring efficient hardware support for applications with irregular memory patterns on multinode manycore architectures
  • CERIANI, MARCO
  • Secchi, Simone
  • Villa, Oreste
  • Tumeo, Antonino
  • PALERMO, GIANLUCA
January 2017

With computing systems becoming ubiquitous, numerous data sets of extremely large size are becoming ...

We use cookies to provide a better user experience.