There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 27 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 1 | - |
dc.citation.title | ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS | - |
dc.citation.volume | 16 | - |
dc.contributor.author | Kim, Yongjoo | - |
dc.contributor.author | Lee, Jongeun | - |
dc.contributor.author | Shrivastava, Aviral | - |
dc.contributor.author | Paek, Yunheung | - |
dc.date.accessioned | 2023-12-22T05:44:36Z | - |
dc.date.available | 2023-12-22T05:44:36Z | - |
dc.date.created | 2013-06-12 | - |
dc.date.issued | 2011-10 | - |
dc.description.abstract | Coarse-grained reconfigurable architectures (CGRAs) promise high performance at high power efficiency. They fulfil this promise by keeping the hardware extremely simple, and moving the complexity to application mapping. One major challenge comes in the form of data mapping. For reasons of power-efficiency and complexity, CGRAs use multibank local memory, and a row of PEs share memory access. In order for each row of the PEs to access any memory bank, there is a hardware arbiter between the memory requests generated by the PEs and the banks of the local memory. However, a fundamental restriction remains in that a bank cannot be accessed by two different PEs at the same time. We propose to meet this challenge by mapping application operations onto PEs and data into memory banks in a way that avoids such conflicts. To further improve performance on multibank memories, we propose a compiler optimization for CGRA mapping to reduce the number of memory operations by exploiting data reuse. Our experimental results on kernels from multimedia benchmarks demonstrate that our local memory-aware compilation approach can generate mappings that are up to 53% better in performance (26% on average) compared to a memory-unaware scheduler. | - |
dc.identifier.bibliographicCitation | ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, v.16, no.4, pp.1 - 27 | - |
dc.identifier.doi | 10.1145/2003695.2003702 | - |
dc.identifier.issn | 1084-4309 | - |
dc.identifier.scopusid | 2-s2.0-80155177632 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/3117 | - |
dc.identifier.url | http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=80155177632 | - |
dc.identifier.wosid | 000297137800006 | - |
dc.language | 영어 | - |
dc.publisher | ASSOC COMPUTING MACHINERY | - |
dc.title | Memory Access Optimization in Compilation for Coarse-Grained Reconfigurable Architectures | - |
dc.type | Article | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture; Computer Science, Software Engineering | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Coarse-grained reconfigurable architecture | - |
dc.subject.keywordAuthor | Compilation | - |
dc.subject.keywordAuthor | multibank memory | - |
dc.subject.keywordAuthor | bank conflict | - |
dc.subject.keywordAuthor | array mapping | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.