Near-optimal and Scalable Intrasignal In-place Optimization for Non-overlapping and Irregular Access Schemes

KRITIKAKOU, Angeliki, CATTHOOR, Francky, KELEFOURAS, Vasileios and GOUTIS, Costas (2013). Near-optimal and Scalable Intrasignal In-place Optimization for Non-overlapping and Irregular Access Schemes. ACM Transactions on Design Automation of Electronic Systems, 19 (1), 4:1-4:30.

Full text not available from this repository.
Official URL: https://dl.acm.org/citation.cfm?doid=2534383
Link to published version:: https://doi.org/10.1145/2534383
Related URLs:

    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.

    Item Type: Article
    Uncontrolled Keywords: Storage size, iteration space, near optimality, scalability
    Departments - Does NOT include content added after October 2018: Faculty of Science, Technology and Arts > Department of Computing
    Identification Number: https://doi.org/10.1145/2534383
    Page Range: 4:1-4:30
    Depositing User: Vasileios Kelefouras
    Date Deposited: 05 Apr 2018 13:22
    Last Modified: 05 Apr 2018 13:22
    URI: http://shura.shu.ac.uk/id/eprint/18344

    Actions (login required)

    View Item View Item

    Downloads

    Downloads per month over past year

    View more statistics