File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이종은

Lee, Jongeun
Intelligent Computing and Codesign Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 1609 -
dc.citation.number 11 -
dc.citation.startPage 1599 -
dc.citation.title IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS -
dc.citation.volume 30 -
dc.contributor.author Kim, Yongjoo -
dc.contributor.author Lee, Jongeun -
dc.contributor.author Shrivastava, Aviral -
dc.contributor.author Yoon, Jonghee W. -
dc.contributor.author Cho, Doosan -
dc.contributor.author Paek, Yunheung -
dc.date.accessioned 2023-12-22T05:41:52Z -
dc.date.available 2023-12-22T05:41:52Z -
dc.date.created 2013-06-19 -
dc.date.issued 2011-11 -
dc.description.abstract Coarse-grained reconfigurable arrays (CGRAs) are a very promising platform, providing both up to 10-100 MOps/mW of power efficiency and software programmability. However, this promise of CGRAs critically hinges on the effectiveness of application mapping onto CGRA platforms. While previous solutions have greatly improved the computation speed, they have largely ignored the impact of the local memory architecture on the achievable power and performance. This paper motivates the need for memory-aware application mapping for CGRAs, and proposes an effective solution for application mapping that considers the effects of various memory architecture parameters including the number of banks, local memory size, and the communication bandwidth between the local memory and the external main memory. Further we propose efficient methods to handle dependent data on a double-buffering local memory, which is necessary for recurrent loops. Our proposed solution achieves 59% reduction in the energy-delay product, which factors into about 47% and 22% reduction in the energy consumption and runtime, respectively, as compared to memory-unaware mapping for realistic local memory architectures. We also show that our scheme scales across a range of applications and memory parameters, and the runtime overhead of handling recurrent loops by our proposed methods can be less than 1%. -
dc.identifier.bibliographicCitation IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, v.30, no.11, pp.1599 - 1609 -
dc.identifier.doi 10.1109/TCAD.2011.2161217 -
dc.identifier.issn 0278-0070 -
dc.identifier.scopusid 2-s2.0-80054828144 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/3426 -
dc.identifier.url http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=80054828144 -
dc.identifier.wosid 000296015200002 -
dc.language 영어 -
dc.publisher IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC -
dc.title High Throughput Data Mapping for Coarse-Grained Reconfigurable Architectures -
dc.type Article -
dc.relation.journalWebOfScienceCategory Computer Science, Hardware & Architecture; Computer Science, Interdisciplinary Applications; Engineering, Electrical & Electronic -
dc.relation.journalResearchArea Computer Science; Engineering -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor Array mapping -
dc.subject.keywordAuthor bank conflict -
dc.subject.keywordAuthor coarse-grained reconfigurable architecture -
dc.subject.keywordAuthor compilation -
dc.subject.keywordAuthor multi-bank memory -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.