Optimizing local memory allocation and assignment through a decoupled approach
dc.citation.epage | 415 | en_US |
dc.citation.spage | 408 | en_US |
dc.contributor.author | Diouf, B. | en_US |
dc.contributor.author | Öztürk, Özcan | en_US |
dc.contributor.author | Cohen, A. | en_US |
dc.coverage.spatial | Newark, DE, USA | |
dc.date.accessioned | 2016-02-08T12:24:07Z | |
dc.date.available | 2016-02-08T12:24:07Z | |
dc.date.issued | 2010-10 | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.description | Conference name: LCPC'09 Proceedings of the 22nd international conference on Languages and Compilers for Parallel Computing | |
dc.description | Date of Conference: 8-10 October, 2009, | |
dc.description.abstract | Software-controlled local memories (LMs) are widely used to provide fast, scalable, power efficient and predictable access to critical data. While many studies addressed LM management, keeping hot data in the LM continues to cause major headache. This paper revisits LM management of arrays in light of recent progresses in register allocation, supporting multiple live-range splitting schemes through a generic integer linear program. These schemes differ in the grain of decision points. The model can also be extended to address fragmentation, assigning live ranges to precise offsets. We show that the links between LM management and register allocation have been underexploited, leaving much fundamental questions open and effective applications to be explored. © 2010 Springer-Verlag. | en_US |
dc.identifier.doi | 10.1007/978-3-642-13374-9_29 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/28572 | en_US |
dc.language.iso | English | en_US |
dc.publisher | Springer | en_US |
dc.relation.isversionof | https://doi.org/10.1007/978-3-642-13374-9_29 | en_US |
dc.source.title | LCPC'09 Proceedings of the 22nd international conference on Languages and Compilers for Parallel Computing | en_US |
dc.subject | Address fragmentation | en_US |
dc.subject | Critical data | en_US |
dc.subject | Decision points | en_US |
dc.subject | Integer linear programs | en_US |
dc.subject | Local memories | en_US |
dc.subject | Power efficient | en_US |
dc.subject | Recent progress | en_US |
dc.subject | Register allocation | en_US |
dc.subject | Lagrange multipliers | en_US |
dc.subject | Linguistics | en_US |
dc.subject | Parallel architectures | en_US |
dc.subject | Program compilers | en_US |
dc.subject | Integer programming | en_US |
dc.title | Optimizing local memory allocation and assignment through a decoupled approach | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Optimizing local memory allocation and assignment through a decoupled approach.pdf
- Size:
- 196.13 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version