Optimizing local memory allocation and assignment through a decoupled approach

Simple item page
dc.citation.epage415en_US
dc.citation.spage408en_US
dc.contributor.authorDiouf, B.en_US
dc.contributor.authorÖztürk, Özcanen_US
dc.contributor.authorCohen, A.en_US
dc.coverage.spatialNewark, DE, USA
dc.date.accessioned2016-02-08T12:24:07Z
dc.date.available2016-02-08T12:24:07Z
dc.date.issued2010-10en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionConference name: LCPC'09 Proceedings of the 22nd international conference on Languages and Compilers for Parallel Computing
dc.descriptionDate of Conference: 8-10 October, 2009,
dc.description.abstractSoftware-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.description.provenanceMade available in DSpace on 2016-02-08T12:24:07Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2010en
dc.identifier.doi10.1007/978-3-642-13374-9_29en_US
dc.identifier.urihttp://hdl.handle.net/11693/28572
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttps://doi.org/10.1007/978-3-642-13374-9_29en_US
dc.source.titleLCPC'09 Proceedings of the 22nd international conference on Languages and Compilers for Parallel Computingen_US
dc.subjectAddress fragmentationen_US
dc.subjectCritical dataen_US
dc.subjectDecision pointsen_US
dc.subjectInteger linear programsen_US
dc.subjectLocal memoriesen_US
dc.subjectPower efficienten_US
dc.subjectRecent progressen_US
dc.subjectRegister allocationen_US
dc.subjectLagrange multipliersen_US
dc.subjectLinguisticsen_US
dc.subjectParallel architecturesen_US
dc.subjectProgram compilersen_US
dc.subjectInteger programmingen_US
dc.titleOptimizing local memory allocation and assignment through a decoupled approachen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
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
Download

Collections

Scholarly Publications - Computer Engineering