KRITIKAKOU, Angeliki, CATTHOOR, Francky, KELEFOURAS, Vasileios and GOUTIS, Costas (2014). A scalable and near-optimal representation of access schemes for memory management. ACM Transactions on Architecture and Code Optimization, 11 (1), 13:1-13:25.
Full text not available from this repository.Abstract
Memory management searches for the resources required to store the concurrently alive elements. The solution quality is affected by the representation of the element accesses: a sub-optimal representation leads to overestimation and a non-scalable representation increases the exploration time. We propose a methodology to near-optimal and scalable represent regular and irregular accesses. The representation consists of a set of pattern entries to compactly describe the behavior of the memory accesses and of pattern operations to consistently combine the pattern entries. The result is a final sequence of pattern entries which represents the global access scheme without unnecessary overestimation.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Storage size, iteration space, memory management, memory optimization, near-optimality, resources, 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/2579677 |
Page Range: | 13:1-13:25 |
Depositing User: | Vasileios Kelefouras |
Date Deposited: | 27 Mar 2018 11:21 |
Last Modified: | 18 Mar 2021 15:20 |
URI: | https://shura.shu.ac.uk/id/eprint/18363 |
Actions (login required)
View Item |
Downloads
Downloads per month over past year