• DocumentCode
    703972
  • Title

    AHEAD: Automated framework for hardware accelerated iterative data analysis

  • Author

    Songhori, Ebrahim M. ; Mirhoseini, Azalia ; Xuyang Lu ; Koushanfar, Farinaz

  • Author_Institution
    Rice Univ., Houston, TX, USA
  • fYear
    2015
  • fDate
    9-13 March 2015
  • Firstpage
    942
  • Lastpage
    947
  • Abstract
    This paper introduces AHEAD, a novel domain-specific framework for automated (hardware-based) acceleration of massive data analysis applications with a dense (non-sparse) correlation matrix. Due to non-scalability of matrix inversion, often iterative computation is used for converging to a solution. AHEAD addresses two sets of domain-specific matrix computation challenges. First, the I/O and memory bandwidth constraints which limit the performance of hardware accelerators. Second, the hardness of handling large data because of the complexity of the known matrix transformations and the inseparability of non-sparse correlations. The inseparability problem translates to an increased communication cost with the accelerators. To optimize the performance within these limits, AHEAD learns the dependency structure of the domain data and suggests a scalable matrix transformation. The transformation minimizes the memory access required for matrix computing within an error threshold and thus, optimizes the mapping of domain data to the available (bandwidth constrained) accelerator resources. To facilitate automation, AHEAD also provides an Application Programming Interface (API) so users can customize the framework to an arbitrary iterative analysis algorithm and hardware mapping. Proof-of-concept implementation of AHEAD is performed on the widely used compressive sensing and general ℓ1 regularized least squares solvers. On a massive light field imaging data set with 4.6B non-zeros, AHEAD attains up to 320x iteration speed improvement using reconfigurable hardware accelerators compared with the conventional solver and about 4x improvement compared to our transformed matrix solver on a general purpose processor (without hardware acceleration).
  • Keywords
    application program interfaces; computational complexity; data analysis; field programmable gate arrays; iterative methods; least squares approximations; matrix algebra; AHEAD; API; application programming interface; arbitrary iterative analysis algorithm; automated framework; dense correlation matrix; hardware accelerated iterative data analysis; hardware mapping; iterative computation; matrix computing; matrix inversion; reconfigurable hardware accelerators; regularized least squares solvers; scalable matrix transformation; Acceleration; Hardware; Kernel; Least squares approximations; Matrix decomposition; Sparse matrices; API; Dense Matrix; FISTA; FP-GAs; Gram Matrix; HLS; Iterative Solver; Least Squares; Sparse Approximation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design, Automation & Test in Europe Conference & Exhibition (DATE), 2015
  • Conference_Location
    Grenoble
  • Print_ISBN
    978-3-9815-3704-8
  • Type

    conf

  • Filename
    7092524