Near-optimal and scalable intrasignal in-place optimization for non-overlapping and irregular access schemes

  • Authors:
  • Angeliki Kritikakou;Francky Catthoor;Vasilios Kelefouras;Costas Goutis

  • Affiliations:
  • University of Patras, Patras, Greece;IMEC and KU Leuven, Leuven, Belgium;University of Patras, Patras, Greece;University of Patras, Patras, Greece

  • Venue:
  • ACM Transactions on Design Automation of Electronic Systems (TODAES)
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Storage-size management techniques aim to reduce the resources required to store elements and to concurrently provide efficient addressing during element accessing. Existing techniques are less appropriate for large iteration spaces with increased numbers of irregularly spread holes. They either have to approximate the accessed regions, leading to overestimation of the final resources, or they require prohibited exploration time to find the storage size. In this work, we present a near-optimal and scalable methodology for storage-size, intrasignal, in-place optimization, that is, to compute the minimum amount of resources required to store the elements of a group (array), for irregular complex access schemes in the target domain of non-overlapping store and load accesses.