Array size computation under uniform overlapping and irregular accesses

KRITIKAKOU, Angeliki, CATTHOOR, Francky, KELEFOURAS, Vasileios and GOUTIS, Costas (2016). Array size computation under uniform overlapping and irregular accesses. ACM Transactions on Design Automation of Electronic Systems, 21 (2), 22:1-22:35.

TODAES_2015_FINAL_v2_7_2015.pdf - Accepted Version
All rights reserved.

Download (1MB) | Preview
Official URL:
Link to published version::


The size required to store an array is crucial for an embedded system, as it affects the memory size, the energy per memory access, and the overall system cost. Existing techniques for finding the minimum number of resources required to store an array are less efficient for codes with large loops and not regularly occurring memory accesses. They have to approximate the accessed parts of the array leading to overestimation of the required resources. Otherwise, their exploration time is increased with an increase over the number of the different accessed parts of the array. We propose a methodology to compute the minimum resources required for storing an array which keeps the exploration time low and provides a near-optimal result for regularly and non-regularly occurring memory accesses and overlapping writes and reads.

Item Type: Article
Uncontrolled Keywords: Liveness, iteration space, near-optimality, resources optimization, scalability
Identification Number:
Page Range: 22:1-22:35
Depositing User: Vasileios Kelefouras
Date Deposited: 27 Mar 2018 10:36
Last Modified: 18 Mar 2021 15:20

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics